Efficient algorithms for finding interleaving relationship between sequences
From MaRDI portal
Publication:2380070
DOI10.1016/j.ipl.2007.08.028zbMath1184.68603OpenAlexW2144662852MaRDI QIDQ2380070
Hsing-Yen Ann, Kuo-Tsung Tseng, Yung-Hsing Peng, Chang-Biau Yang, Kuo-Si Huang
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.028
Related Items
New tabulation and sparse dynamic programming based techniques for sequence similarity problems ⋮ The generalized definitions of the two-dimensional largest common substructure problems ⋮ Efficient merged longest common subsequence algorithms for similar sequences ⋮ Linear-space S-table algorithms for the longest common subsequence problem ⋮ Finding the gapped longest common subsequence by incremental suffix maximum queries ⋮ BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM ⋮ Efficient algorithms for the block edit problems ⋮ AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS
Cites Work
- A fast algorithm for computing a longest common increasing subsequence
- Dynamic programming algorithms for the mosaic longest common subsequence problem
- Sparse LCS common substring alignment
- Geometric applications of a matrix-searching algorithm
- A simple algorithm for the constrained sequence problems
- On the Common Substring Alignment Problem
- A linear space algorithm for computing maximal common subsequences
- The Complexity of Some Problems on Subsequences and Supersequences
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Algorithms on Strings, Trees and Sequences
- Sparse Dynamic Programming for Longest Common Subsequence from Fragments
- Combinatorial Pattern Matching
