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

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

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

Cited in

(10)

• On the computational complexity of 2-interval pattern matching problems
• scientific article; zbMATH DE number 1615278 (Why is no real title available?)
• Finding occurrences of protein complexes in protein-protein interaction graphs
• 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 7561345 (Why is no real title available?)
• Fast arc-annotated subsequence matching in linear space
• The longest common subsequence problem for sequences with nested arc annotations.
• A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
• Computing the similarity of two sequences with nested arc annotations

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)