An approximation algorithm for alignment of multiple sequences using motif discovery

DOI10.1023/A:1009841927822zbMath0960.90076OpenAlexW1513998118MaRDI QIDQ1306405

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

zbMATH Keywords

protein sequencesset covering problemmultiple sequence alignmentapproximate algorithmmotif discoveryalignment numberMAX SNP hard

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

This page was built for publication: An approximation algorithm for alignment of multiple sequences using motif discovery