A combinatorial optimization approach for diverse motif finding applications
<p>Abstract</p> <p>Background</p> <p>Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most frequently, motif finding applications arise when identifying shared...
Main Authors: | Singh Mona, Zaslavsky Elena |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2006-08-01
|
Series: | Algorithms for Molecular Biology |
Online Access: | http://www.almob.org/content/1/1/13 |
Similar Items
-
Fast-Find: A novel computational approach to analyzing combinatorial motifs
by: Knight Rob, et al.
Published: (2006-01-01) -
Combinatorial and Probabilistic Approaches to Motif Recognition
by: Boucher, Christina, Anne
Published: (2010) -
Combinatorial and Probabilistic Approaches to Motif Recognition
by: Boucher, Christina, Anne
Published: (2010) -
Finding Combinatorial Motifs in DNA sequences by APPA (Apriori Pruning Algorithm)
by: Wan-Hsien Lin, et al.
Published: (2004) -
Combinatorial motif analysis in yeast gene promoters: the benefits of a biological consideration of motifs
by: Childs, Kevin
Published: (2005)