A cost-aggregating integer linear program for motif finding

DOI10.1016/J.JDA.2011.04.001zbMATH Open1228.92026OpenAlexW2028931669WikidataQ39017930 ScholiaQ39017930MaRDI QIDQ655435FDOQ655435

Authors: Carl Kingsford, Elena Zaslavsky, Mona Singh 

Publication date: 4 January 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.04.001

Recommendations

• A Compact Mathematical Programming Formulation for DNA Motif Finding
• Toward optimal motif enumeration.
• Discovering almost any hidden motif from multiple sequences
• Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
• A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS

zbMATH Keywords

computational biologysequence motif findings

Mathematics Subject Classification ID

Linear programming (90C05) Biochemistry, molecular biology (92C40) Integer programming (90C10) Algorithms on strings (68W32) Algorithms in computer science (68W99)

Cites Work

• Geometric algorithms and combinatorial optimization.
• A semidefinite programming approach to side chain positioning with new rounding strategies
• Finding similar regions in many sequences
• Approximation algorithms for multiple sequence alignment
• A Compact Mathematical Programming Formulation for DNA Motif Finding

Cited In (1)

• A Compact Mathematical Programming Formulation for DNA Motif Finding

This page was built for publication: A cost-aggregating integer linear program for motif finding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655435)