Aligning two fragmented sequences

DOI10.1016/S0166-218X(02)00289-5zbMath1014.92012MaRDI QIDQ1868717

Webb Miller, Vamsi Veeramachaneni, Piotr Berman

Publication date: 28 April 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsMAX-SNP hardnesssequence assembly

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

Fixed interval scheduling: models, applications, computational complexity and algorithms

Cites Work

• Multi-phase algorithms for throughput maximization for real-time scheduling
• Approximating the throughput of multiple machines under real-time scheduling
• Some Theorems on Abstract Graphs

This page was built for publication: Aligning two fragmented sequences