Gap Filling as Exact Path Length Problem

DOI10.1007/978-3-319-16706-0_29zbMath1355.92033OpenAlexW274934192MaRDI QIDQ2814587

Veli Mäkinen, Leena Salmela, Kristoffer Sahlin, 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

NP-hardexact path length problemgap filling solution

Mathematics Subject Classification ID

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

Related Items (1)

Safe and Complete Contig Assembly Via Omnitigs

Cites Work

• Unnamed Item
• The Exact Path Length Problem
• Biological Sequence Analysis
• A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
• Reducibility among Combinatorial Problems

This page was built for publication: Gap Filling as Exact Path Length Problem