Efficient algorithms for the discovery of gapped factors
<p>Abstract</p> <p>Background</p> <p>The discovery of surprisingly frequent patterns is of paramount interest in bioinformatics and computational biology. Among the patterns considered, those consisting of pairs of solid words that co-occur within a prescribed maximum d...
Main Authors: | Pizzi Cinzia, Apostolico Alberto, Ukkonen Esko |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2011-03-01
|
Series: | Algorithms for Molecular Biology |
Online Access: | http://www.almob.org/content/6/1/5 |
Similar Items
-
Efficient Algorithms for the Discovery of Frequent Superset
by: Liao, Zhung-Xun, et al.
Published: (2004) -
Fast algorithms for computing sequence distances by exhaustive substring composition
by: Apostolico Alberto, et al.
Published: (2008-10-01) -
Efficient topology discovery algorithm for software‐defined networks
by: George Tarnaras, et al.
Published: (2017-11-01) -
Efficiency of distributed queueing games and of path discovery algorithms
by: Doncel, Josu
Published: (2015) -
Efficient Algorithms of Sequence Alignments with Concave Gap Penalties
by: Cai,Wei-Qian, et al.
Published: (2015)