Fast Algorithms for Local Similarity Queries in Two Sequences

DOI10.1142/S0129054115500355zbMath1330.68355MaRDI QIDQ2949727

Abdullah N. Arslan

Publication date: 2 October 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingsuffix arraysuffix treelongest common subsequencestring edit distancelowest common ancestorlongest common extensionstring algorithm

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• An O(NP) sequence comparison algorithm
• The constrained longest common subsequence problem
• The longest common subsequence problem revisited
• An \(O(ND)\) difference algorithm and its variations
• A faster algorithm computing string edit distances
• A longest common subsequence algorithm suitable for similar text strings
• Performance analysis of some simple heuristics for computing longest common subsequences
• A simple algorithm for the constrained sequence problems
• Algorithms for approximate string matching
• The String-to-String Correction Problem
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS

This page was built for publication: Fast Algorithms for Local Similarity Queries in Two Sequences