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
In this respect depth-first search (DFS) is the exact reverse process: whenever it sends a new node, it immediately continues to extend from it. It sends back to previously explore

give some examples of least cost branch and bound method..

an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

Q. Write down an algorithm for finding a key from a sorted list using the binary search technique or method.

Inorder traversal: The left sub tree is visited, then the node and then right sub-tree. Algorithm for inorder traversal is following: traverse left sub-tree visit node

difference between recursion and iteration

Run time complexity of an algorithm is depend on

Arrays are simple, however reliable to employ in more condition than you can count. Arrays are utilized in those problems while the number of items to be solved out is fixed. They

Program segment for the deletion of any element from the queue delmq(i)  /* Delete any element from queue i */ { int i,x; if ( front[i] == rear[i]) printf("Queue is

implement multiple stack in single dimensionl array.write algorithms for various stack operation for them