Computer Science – Data Structures and Algorithms
Scientific paper
2010-02-04
Computer Science
Data Structures and Algorithms
A preliminary version of this work was presented in WABI 2009. 10 pages, 0 figures
Scientific paper
We develop, analyze and experiment with a new tool, called MADMX, which extracts frequent motifs, possibly including don't care characters, from biological sequences. We introduce density, a simple and flexible measure for bounding the number of don't cares in a motif, defined as the ratio of solid (i.e., different from don't care) characters to the total length of the motif. By extracting only maximal dense motifs, MADMX reduces the output size and improves performance, while enhancing the quality of the discoveries. The efficiency of our approach relies on a newly defined combining operation, dubbed fusion, which allows for the construction of maximal dense motifs in a bottom-up fashion, while avoiding the generation of nonmaximal ones. We provide experimental evidence of the efficiency and the quality of the motifs returned by MADMX
Grossi Roberto
Pietracaprina Andrea
Pisanti Nadia
Pucci Geppino
Upfal Eli
No associations
LandOfFree
MADMX: A Novel Strategy for Maximal Dense Motif Extraction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with MADMX: A Novel Strategy for Maximal Dense Motif Extraction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MADMX: A Novel Strategy for Maximal Dense Motif Extraction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-154353