A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings

DOI10.1016/J.IPL.2008.07.005zbMATH Open1191.68818OpenAlexW2111356103MaRDI QIDQ975491FDOQ975491

Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor, Hsing-Yen Ann

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.005

Recommendations

• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• Computing the longest common subsequence of two run-length encoded strings
• A fast longest common subsequence algorithm for similar strings
• Efficient algorithms for the longest common subsequence in \(k\)-length substrings
• A new efficient algorithm for computing the longest common subsequence
• A New Efficient Algorithm for Computing the Longest Common Subsequence
• A fast algorithm of constrained longest common subsequence
• Fast algorithms for computing the constrained LCS of run-length encoded strings
• Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
• A space efficient algorithm for the longest common subsequence in \(k\)-length substrings

zbMATH Keywords

edit distancelongest common subsequencedesign of algorithmsrun-length encoding

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The String-to-String Correction Problem
• Matching for run-length encoded strings
• Fast Algorithms for Finding Nearest Common Ancestors
• A unifying look at data structures
• A fast algorithm for computing longest common subsequences
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
• Algorithms for the Longest Common Subsequence Problem
• An improved algorithm for computing the edit distance of run-length coded strings
• Simple and fast linear space computation of longest common subsequences
• Edit distance of run-length encoded strings.
• Edit distance for a run-length-encoded string and an uncompressed string

Cited In (14)

• AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS
• Title not available (Why is that?)
• Fast algorithms for computing the constrained LCS of run-length encoded strings
• Title not available (Why is that?)
• Edit distance of run-length encoded strings.
• Finding the gapped longest common subsequence by incremental suffix maximum queries
• An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
• Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
• The generalized definitions of the two-dimensional largest common substructure problems
• Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
• Efficient merged longest common subsequence algorithms for similar sequences
• Sequence Alignment Algorithms for Run-Length-Encoded Strings
• A diagonal-based algorithm for the longest common increasing subsequence problem
• Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions

This page was built for publication: A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings

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