Improved algorithms for largest cardinality 2-interval pattern problem

DOI10.1007/s10878-006-9030-8zbMath1123.68136OpenAlexW2102566324MaRDI QIDQ996829

Erdong Chen, Linji Yang, Hao Yuan

Publication date: 19 July 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-9030-8

zbMATH Keywords

RNA secondary structure2-interval pattern

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Related Items (5)

On recognising words that are squares for the shuffle product ⋮ On two open problems of 2-interval patterns ⋮ Parameterized complexity of two-interval pattern problem ⋮ On recovering syntenic blocks from comparative maps ⋮ On Recovering Syntenic Blocks from Comparative Maps

Cites Work

• Unnamed Item
• Unnamed Item
• Trapezoid graphs and generalizations, geometry and algorithms
• The longest common subsequence problem for arc-annotated sequences
• On the computational complexity of 2-interval pattern matching problems
• Computing the similarity of two sequences with nested arc annotations
• Efficient algorithms for finding maximum cliques of an overlap graph
• Algorithms and Computation
• Combinatorial Pattern Matching
• Algorithms – ESA 2005

This page was built for publication: Improved algorithms for largest cardinality 2-interval pattern problem