Co-linear chaining with overlaps and gap costs
From MaRDI portal
Publication:2170153
DOI10.1007/978-3-031-04749-7_15zbMATH Open1497.92185OpenAlexW4285217451MaRDI QIDQ2170153FDOQ2170153
Authors: Chirag Jain, Daniel Gibney, Sharma V. Thankachan 
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-04749-7_15
Recommendations
Cites Work
- A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
- Computational geometry. Algorithms and applications.
- Sparse dynamic programming I
- Algorithms for approximate string matching
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- Chaining algorithms for multiple genome comparison
- Sparse dynamic programming II
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Title not available (Why is that?)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance
- Sparse dynamic programming on DAGs with small width
Cited In (5)
- Multiple genome alignment: chaining algorithms revisited
- Sequence to graph alignment using gap-sensitive co-linear chaining
- Chaining algorithms for multiple genome comparison
- Co-linear chaining on pangenome graphs
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
Uses Software
This page was built for publication: Co-linear chaining with overlaps and gap costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170153)
