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
Define File organization''s and it''s types

extra key inserted at end of array is called

We have discussed already about three tree traversal methods in the earlier section on general tree. The similar three different ways to do the traversal -inorder , preorder, and p

difference between recursion and iteration

Create a Money data structure that is made up of amount and currency. (a) Write a constructor for this data structure (b) Create accessors for this data structure (c) Writ

two standards ways of traversing a graph in data structure

How to construct a data flow diagram for a college assignment and marking systemA

Q. Let a binary tree 'T' be in memory. Write a procedure to delete all terminal nodes of the tree.       A n s . fun ction to Delete Terminal Nodes from Binary Tree

The  total  of  time  needed  by  an algorithm to run to its completion is termed as time complexity. The asymptotic running time of an algorithm is given in terms of functions. Th

N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)