scientific article; zbMATH DE number 7286739

DOI10.4230/LIPIcs.CPM.2018.13zbMath1497.68596MaRDI QIDQ5140776

Brian Brubach, Jay Ghurye

Publication date: 16 December 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

genomicsedit distancebanded alignmentmethod of the four Russiansone-against-many alignment

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm
• An \(O(ND)\) difference algorithm and its variations
• Geometric applications of a matrix-searching algorithm
• A faster algorithm computing string edit distances
• Fast string correction with Levenshtein automata
• Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
• Fast Approximate Search in Large Dictionaries
• Algorithms for approximate string matching
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
• Algorithms on Strings, Trees and Sequences
• A Four Russians algorithm for regular expression pattern matching
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
• A Subquadratic Algorithm for Approximate Regular Expression Matching

This page was built for publication: