scientific article; zbMATH DE number 2087047

zbMATH Open1077.68738MaRDI QIDQ4737693FDOQ4737693

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

Title of this publication is not available (Why is that?)

Recommendations

• Computing the similarity of two sequences with nested arc annotations
• scientific article; zbMATH DE number 1754611
• The longest common subsequence problem for sequences with nested arc annotations.
• The longest common subsequence problem for arc-annotated sequences
• scientific article; zbMATH DE number 1615278

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
• Title not available (Why is that?)
• Finding occurrences of protein complexes in protein-protein interaction graphs
• 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
• On the computational complexity of 2-interval pattern matching problems
• Fast arc-annotated subsequence matching in linear space

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)