Efficient algorithms for finding interleaving relationship between sequences

DOI10.1016/J.IPL.2007.08.028MaRDI QIDQ2380070zbMATH OpenOpenAlexFDO

Authors Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hsing-Yen Ann, Yung-Hsing Peng

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

zbMATH Keywords

bioinformaticsdesign of algorithmsdynamic programminglongest common subsequencemerged sequence

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Dynamic programming (90C39)

Recommendations

• Efficient merged longest common subsequence algorithms for similar sequences
• Efficient algorithms for finding a longest common increasing subsequence
• Dynamic programming algorithms for the mosaic longest common subsequence problem
• Bit-parallel algorithms for the merged longest common subsequence problem
• Algorithms and Computation

Cites work

• A fast algorithm for computing a longest common increasing subsequence
• A linear space algorithm for computing maximal common subsequences
• A simple algorithm for the constrained sequence problems
• Algorithms on Strings, Trees and Sequences
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
• Combinatorial Pattern Matching
• Dynamic programming algorithms for the mosaic longest common subsequence problem
• Geometric applications of a matrix-searching algorithm
• On the common substring alignment problem
• Sparse Dynamic Programming for Longest Common Subsequence from Fragments
• Sparse LCS common substring alignment
• The Complexity of Some Problems on Subsequences and Supersequences

Cited in

(11)

• Efficient merged longest common subsequence algorithms for similar sequences
• The generalized definitions of the two-dimensional largest common substructure problems
• Finding the gapped longest common subsequence by incremental suffix maximum queries
• New tabulation and sparse dynamic programming based techniques for sequence similarity problems
• Fast Intersection Algorithms for Sorted Sequences
• Bit-parallel algorithms for the merged longest common subsequence problem
• An algorithm and applications to sequence alignment with weighted constraints
• Combinatorial Pattern Matching
• Linear-space S-table algorithms for the longest common subsequence problem
• The merged longest common increasing subsequence problem
• Efficient algorithms for the block edit problems

This page was built for publication: Efficient algorithms for finding interleaving relationship between sequences

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