A cost-aggregating integer linear program for motif finding
From MaRDI portal
Publication:655435
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
Cites work
- A Compact Mathematical Programming Formulation for DNA Motif Finding
- A semidefinite programming approach to side chain positioning with new rounding strategies
- Approximation algorithms for multiple sequence alignment
- Finding similar regions in many sequences
- Geometric algorithms and combinatorial optimization.
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)