An approximation algorithm for alignment of multiple sequences using motif discovery
DOI10.1023/A:1009841927822zbMATH Open0960.90076OpenAlexW1513998118MaRDI QIDQ1306405FDOQ1306405
Laxmi Parida, Isidore Rigoutsos, Aris Floratos
Publication date: 20 May 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009841927822
Recommendations
- Approximation algorithms for multiple sequence alignment
- Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences
- Probabilistic analysis of a motif discovery algorithm for multiple sequences
- A New Dynamic Programming Algorithm for Multiple Sequence Alignment
- An optimization approach to multiple sequence alignment
- An algorithmic framework for motif discovery problems in weighted sequences
- scientific article; zbMATH DE number 2243390
set covering problemapproximate algorithmmultiple sequence alignmentprotein sequencesmotif discoveryalignment numberMAX SNP hard
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (7)
- Novel evolutionary models and applications to sequence alignment problems
- Title not available (Why is that?)
- Non-approximability of weighted multiple sequence alignment.
- An optimization approach to multiple sequence alignment
- An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
- Pattern-constrained multiple polypeptide sequence alignment
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
This page was built for publication: An approximation algorithm for alignment of multiple sequences using motif discovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306405)
