Comparing Assemblies Using Fragments and Mate-Pairs

DOI10.1007/3-540-44696-6_23MaRDI QIDQ4801169zbMATH OpenOpenAlexFDO

Authors Aaron L. Halpern, Zhongwu Lai, Eugene W. Myers, Knut Reinert, Granger G. Sutton III, D. Huson

Publication date 6 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44696-6_23

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Recommendations

• scientific article; zbMATH DE number 2089953
• scientific article; zbMATH DE number 956614
• An Eulerian path approach to DNA fragment assembly
• DNA fragments assembly programs: A comparative study
• scientific article; zbMATH DE number 1301600

Cited in

(5)

• A practical parameterised algorithm for the individual haplotyping problem MLF
• Synteny paths for assembly graphs comparison
• A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem
• scientific article; zbMATH DE number 2089953 (Why is no real title available?)
• An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs

This page was built for publication: Comparing Assemblies Using Fragments and Mate-Pairs

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