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
Q. Let X = (X1, X2, X3,....Xn) and Y= (Y1, Y2, Y3,....Xm) be the two linked lists respectively. Write down an algorithm to merge the lists together to get the linked list Z such th

Book to refer: Introduction to Algorithms, 3rd Ed, by Clifford Stein, Thomas H. Cormen, Ronald Rivest, Charles E. Leiserson Question: Tic Tac Toe game -Design a GUI and implement

The Ruby Programming Language Although data structures and algorithms we study aren't tied to any program or programming language, we need to write particular programs in speci

Q. Devise a representation for a given list where insertions and deletions can be made at both the ends. Such a structure is called Deque (which means Double ended queue). Write fu

We might sometimes seek a tradeoff among space & time complexity. For instance, we may have to select a data structure which requires a lot of storage to reduce the computation tim

What is complexity of an algorithm? What is the basic relation between the time and space complexities of an algorithm? Justify your answer by giving an example.

(a) Write (delay ) as a special form for (lambda () ) and (force ), as discussed in class. (b) Write (stream-cons x y) as a special form, as discussed in class. (c) Write

I was wanting to know where this web site was created. My second question is,,, are the online tuters accredited teachers? If they are, are they only working for the website or ma

Ans: A procedure to reverse the singly linked list: reverse(struct node **st) { struct node *p, *q, *r; p = *st; q = NULL; while(p != NULL) { r =q;

Explain All-pair shortest-paths problem Given a weighted linked graph (undirected or directed), the all pairs shortest paths problem asks to find the distances (the lengths of