A Polynomial Time Solution for Permutation Scaffold Filling

DOI10.1007/978-3-319-48749-6_60zbMath1483.68505OpenAlexW2540990550MaRDI QIDQ2958369

Binhai Zhu, Nan Liu, Peng Zou

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_60

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Genetics and epigenetics (92D10) Algorithms on strings (68W32)

Related Items (3)

A new approximation algorithm for contig-based genomic scaffold filling ⋮ Genomic Scaffold Filling: A Progress Report ⋮ On the solution bound of two-sided scaffold filling

Cites Work

• Fixed-parameter algorithms for scaffold filling
• Genomic Scaffold Filling Revisited.
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: A Polynomial Time Solution for Permutation Scaffold Filling