scientific article; zbMATH DE number 1615278

MaRDI QIDQ2723948zbMATHFDO

Authors Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang

Publication date 8 July 2001

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)

Recommendations

• The longest common subsequence problem for arc-annotated sequences
• The longest common subsequence problem for arc-annotated sequences
• The longest common subsequence problem for sequences with nested arc annotations.
• scientific article; zbMATH DE number 1754611
• scientific article; zbMATH DE number 2087047
• The longest common subsequence problem revisited
• scientific article; zbMATH DE number 6161102
• The constrained longest common subsequence problem
• scientific article; zbMATH DE number 6161488

Cited in

(18)

• On the computational complexity of 2-interval pattern matching problems
• Extracting constrained 2-interval subsets in 2-interval sets
• scientific article; zbMATH DE number 1754611 (Why is no real title available?)
• scientific article; zbMATH DE number 2087047 (Why is no real title available?)
• Algorithms for computing variants of the longest common subsequence problem
• A brief history of parameterized matching problems
• scientific article; zbMATH DE number 2185647 (Why is no real title available?)
• The longest common subsequence problem for arc-annotated sequences
• Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
• An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
• The longest common subsequence problem for sequences with nested arc annotations.
• Fast detection of common sequence structure patterns in RNAs
• A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
• Computing the similarity of two sequences with nested arc annotations
• Arc-preserving subsequences of arc-annotated sequences
• Approximating longest common subsequence in linear time: beating the \(\sqrt{n}\) barrier
• The longest common subsequence problem for arc-annotated sequences
• How to Compare Arc-Annotated Sequences: The Alignment Hierarchy

This page was built for publication:

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