Sequence to graph alignment using gap-sensitive co-linear chaining

DOI10.1007/978-3-031-29119-7_4zbMath1528.92026MaRDI QIDQ6070707

Chirag Jain, Ghanshyam Chandra

Publication date: 24 November 2023

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

zbMATH Keywords

pangenomesparse dynamic programmingminimum path covervariation graph

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20)

Cites Work

• Improved approximate pattern matching on hypertext
• Co-linear chaining with overlaps and gap costs
• Fast and optimal sequence-to-graph alignment guided by seeds
• Chaining algorithms for multiple genome comparison
• Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
• Sparse dynamic programming I
• Sparse dynamic programming II
• Sparse Dynamic Programming on DAGs with Small Width
• Computational graph pangenomics: a tutorial on data structures and their applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequence to graph alignment using gap-sensitive co-linear chaining