Name
Abstract | ||
|---|---|---|
We develop, analyze, and experiment with a new tool, called madmx, which extracts frequent motifs from biological sequences. We introduce the notion of density to single out the "significant" motifs. The density is a simple and flexible measure for bounding the number of don't cares in a motif, defined as the fraction of solid (i.e., different from don't care) characters in the motif. A maximal dense motif has density above a certain threshold, and any further specialization of a don't care symbol in it or any extension of its boundaries decreases its number of occurrences in the input sequence. 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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1089/cmb.2010.0177 | JOURNAL OF COMPUTATIONAL BIOLOGY |
Keywords | Field | DocType |
algorithms,motifs extraction | Motif (music),Artificial intelligence,Bioinformatics,Machine learning,Mathematics,Sequence analysis,Bounding overwatch | Journal |
Volume | Issue | ISSN |
18.0 | 4 | 1066-5277 |
Citations | PageRank | References |
8 | 0.47 | 10 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto Grossi | 1 | 581 | 57.47 |
| Andrea Pietracaprina | 2 | 131 | 16.33 |
| Nadia Pisanti | 3 | 302 | 30.91 |
| Geppino Pucci | 4 | 443 | 50.49 |
| Eli Upfal | 5 | 4310 | 743.13 |
| Fabio Vandin | 6 | 218 | 27.55 |