scientific article; zbMATH DE number 1615278
From MaRDI portal
zbMATH Open0964.92031MaRDI QIDQ2723948FDOQ2723948
Guohui Lin, Bin Ma, Kaizhong Zhang, Tao Jiang
Publication date: 8 July 2001
Title of this publication is not available (Why is that?)
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
Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)
Cited In (16)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
- A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
- Fast detection of common sequence structure patterns in RNAs
- The longest common subsequence problem for arc-annotated sequences
- The longest common subsequence problem for sequences with nested arc annotations.
- Computing the similarity of two sequences with nested arc annotations
- Extracting constrained 2-interval subsets in 2-interval sets
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier
- Algorithms for computing variants of the longest common subsequence problem
- How to Compare Arc-Annotated Sequences: The Alignment Hierarchy
- On the computational complexity of 2-interval pattern matching problems
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- A brief history of parameterized matching problems
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)