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
For the following graph find the adjacency matrix and adjacency list representation of the graph.

write pseudocode to implement a queue with two stacks

implement multiple stacks ina single dimensional array. write algorithams for various stack operation for them.

Part1: Deque and Bag Implementation First, complete the Linked List Implementation of the Deque (as in Worksheet 19) and Bag ADTs (Worksheet 22). Files Needed: linkedList.c Linke

Binary tree creation struct NODE { struct NODE *left; int value; struct NODE *right; }; create_tree( struct NODE *curr, struct NODE *new ) { if(new->val

Definition of Algorithm Algorithm must have the following five characteristic features: 1.      Input 2.      Output 3.      Definiteness 4.      Effectiveness 5

Implement a linear-expected-time algorithm for selecting the k th smallest element Algorithm description 1. If |S| = 1, then k = 1 and return the element in S as the an

In a sorted list, Binary search is carried out by dividing the list into two parts depends on the comparison of the key. Since the search interval halves each time, the iteration o

Determine the importance of array Arrays are significant since they allow many values to be stored in a single data structure whereas providing very fast access to each value.

DEPTH FIRST SEARCH (DFS) The approach adopted into depth first search is to search deeper whenever possible. This algorithm frequently searches deeper through visiting unvisite