Dataset for dmi, Data Structure & Algorithms

The following DNA sequences are extracted from promoter region of genes which are co-regulated by the same transcription factor (TF). The nucleotide segments capitalized in the given sequences are true transcription factor binding sites (TFBSs, also termed as regulatory elements, motif instances), which have been aligned using some alignment tools. Therefore, the location information of true TFBSs appearing in the sequence IDs may not be accurate.

Notation of the sequence ID:

It is illustrated by an example as follows:

>AF051909

392-397:CAGCTG

413-418:CAGGTG

Name of Genes

Position: aligned TFBS

Position: aligned TFBS

Posted Date: 3/29/2013 5:30:01 AM | Location : United States







Related Discussions:- Dataset for dmi, Assignment Help, Ask Question on Dataset for dmi, Get Answer, Expert's Help, Dataset for dmi Discussions

Write discussion on Dataset for dmi
Your posts are moderated
Related Questions
The Space - Time Trade Off The best algorithm to solve a given problem is one that needs less space in memory and takes less time to complete its implementation. But in practic

The insertion procedure in a red-black tree is similar to a binary search tree i.e., the insertion proceeds in a similar manner but after insertion of nodes x into the tree T, we c


1)    The set of the algorithms whose order is O (1) would run in the identical time.  True/False 2)    Determine the complexity of the following program into big O notation:

Instructions : You have to design a doubly linked list container. The necessary classes and their declarations are given below The main() function for testing the yo

Ask question #explain it beriflyMinimum 100 words accepted#

a) Run your program for α = 0.05, 0.5, and 0.95. You can use n = 30, and W = 10. What is impact of increasing value of α on connectivity of G'? To answer this question, for each v

Can a Queue be shown by circular linked list with only single pointer pointing to the tail of the queue? Yes a Queue can be shown by a circular linked list with only single p

a. Explain the sum of subset problem. Apply backtracking to solve the following instance of sum of subset problem: w= (3, 4, 5, 6} and d = 13. Briefly define the method using a sta

Graph terminologies : Adjacent vertices: Two vertices a & b are said to be adjacent if there is an edge connecting a & b. For instance, in given Figure, vertices 5 & 4 are adj