Gap filling as exact path length problem

DOI10.1007/978-3-319-16706-0_29MaRDI QIDQ2814587zbMATH OpenOpenAlexFDO

Authors Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, Alexandru I. Tomescu

Publication date 22 June 2016

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

Full work available at URL http://hdl.handle.net/10138/223870

zbMATH Keywords

exact path length problemgap filling solutionNP-hard

Mathematics Subject Classification ID

Applications of graph theory (05C90) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Biochemistry, molecular biology (92C40)

Recommendations

• Global optimization for scaffolding and completing genome assemblies
• Genomic scaffold filling revisited
• Genomic scaffold filling: a progress report
• scientific article; zbMATH DE number 7203332
• The algorithm for the two-sided scaffold filling problem

Cites work

• A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
• Biological Sequence Analysis
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Reducibility among combinatorial problems
• The exact path length problem.

Cited in

(1)

• Safe and complete contig assembly via omnitigs

This page was built for publication: Gap filling as exact path length problem

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