A combinatorial optimization approach for diverse motif finding applications

Abstract

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 regulatory signals within DNA sequences or shared functional and structural elements within protein sequences. Due to the… (More)
DOI: 10.1186/1748-7188-1-13

Topics

4 Figures and Tables

Statistics

01020'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

54 Citations

Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Zaslavsky2006ACO, title={A combinatorial optimization approach for diverse motif finding applications}, author={Elena Zaslavsky and Mona Singh}, journal={Algorithms for Molecular Biology}, year={2006}, volume={1}, pages={13 - 13} }