Periodic String Comparison

DOI10.1007/978-3-642-02441-2_18MaRDI QIDQ3637113zbMATH OpenOpenAlexFDO

Authors Alexander Tiskin

Publication date 7 July 2009

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02441-2_18

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Semi-local string comparison: algorithmic techniques and applications
• scientific article; zbMATH DE number 1786451
• Tandem cyclic alignment
• Incremental String Comparison
• Semi-local longest common subsequences in subquadratic time

Cites work

• A faster algorithm computing string edit distances
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
• An all-substrings common subsequence algorithm
• Approximate matching of regular expressions
• Identifying periodic occurrences of a template with applications to protein structure
• On the common substring alignment problem
• Semi-local longest common subsequences in subquadratic time
• Semi-local string comparison: algorithmic techniques and applications
• Tandem cyclic alignment
• The String-to-String Correction Problem
• The theory and computation of evolutionary distances: Pattern recognition
• Two algorithms for LCS consecutive suffix alignment

Cited in

(5)

• scientific article; zbMATH DE number 1092948 (Why is no real title available?)
• Comparing Degenerate Strings
• Periodic words, common subsequences and frogs
• Fast distance multiplication of unit-Monge matrices
• Efficient all path score computations on grid graphs

This page was built for publication: Periodic String Comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637113)