Improved algorithms for largest cardinality 2-interval pattern problem
From MaRDI portal
Publication:996829
DOI10.1007/S10878-006-9030-8zbMATH Open1123.68136OpenAlexW2102566324MaRDI QIDQ996829FDOQ996829
Authors: 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
Recommendations
Protein sequences, DNA sequences (92D20) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the similarity of two sequences with nested arc annotations
- The longest common subsequence problem for arc-annotated sequences
- Trapezoid graphs and generalizations, geometry and algorithms
- On the computational complexity of 2-interval pattern matching problems
- Algorithms and Computation
- Efficient algorithms for finding maximum cliques of an overlap graph
- Combinatorial Pattern Matching
- Algorithms – ESA 2005
Cited In (10)
- On recognising words that are squares for the shuffle product
- On two open problems of 2-interval patterns
- Combinatorial Pattern Matching
- A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
- On recovering syntenic blocks from comparative maps
- Approximating the 2-interval pattern problem
- Parameterized complexity of two-interval pattern problem
- On Recovering Syntenic Blocks from Comparative Maps
- Algorithms and Computation
- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model
This page was built for publication: Improved algorithms for largest cardinality 2-interval pattern problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996829)
