scientific article
From MaRDI portal
Publication:2723948
zbMath0964.92031MaRDI QIDQ2723948
Guo-Hui Lin, Bin Ma, Zhang, Kaizhong, Tao Jiang
Publication date: 8 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20)
Related Items (11)
The longest common subsequence problem for sequences with nested arc annotations. ⋮ On the computational complexity of 2-interval pattern matching problems ⋮ Computing the similarity of two sequences with nested arc annotations ⋮ A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs ⋮ Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier ⋮ An \(A^\ast\) search algorithm for the constrained longest common subsequence problem ⋮ Algorithms for computing variants of the longest common subsequence problem ⋮ Extracting constrained 2-interval subsets in 2-interval sets ⋮ Fast detection of common sequence structure patterns in RNAs ⋮ Fixed-parameter algorithms for protein similarity search under mRNA structure constraints ⋮ A brief history of parameterized matching problems
This page was built for publication:
