scientific article; zbMATH DE number 2087047

MaRDI QIDQ4737693zbMATH OpenFDO

Authors Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730099.htm

Mathematics Subject Classification ID

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

Recommendations

• Computing the similarity of two sequences with nested arc annotations
• The longest common subsequence problem for sequences with nested arc annotations (extended abstract)
• The longest common subsequence problem for sequences with nested arc annotations.
• The longest common subsequence problem for arc-annotated sequences
• The longest common subsequence problem for arc-annotated sequences

Cited in

(10)

• Finding occurrences of protein complexes in protein-protein interaction graphs
• 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
• Fast arc-annotated subsequence matching in linear space
• Extracting constrained 2-interval subsets in 2-interval sets
• The longest common subsequence problem for arc-annotated sequences
• The longest common subsequence problem for sequences with nested arc annotations (extended abstract)
• Sketching, streaming, and fine-grained complexity of (weighted) LCS
• A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs

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 Q4737693)