Finding common structured patterns in linear graphs
From MaRDI portal
Publication:974741
DOI10.1016/j.tcs.2010.02.017zbMath1209.68367OpenAlexW2000491730MaRDI QIDQ974741
Danny Hermelin, Stéphane Vialette, Guillaume Fertin, Romeo Rizzi
Publication date: 7 June 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.02.017
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pattern matching for permutations
- A computational model for RNA multiple structural alignment
- On two open problems of 2-interval patterns
- The longest common subsequence problem revisited
- A faster algorithm computing string edit distances
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- Covering and coloring polygon-circle graphs
- On the computational complexity of 2-interval pattern matching problems
- Extracting constrained 2-interval subsets in 2-interval sets
- A decomposition theorem for partially ordered sets
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Crossings and nestings of matchings and partitions
- Efficient algorithms for interval graphs and circular-arc graphs
- A fast algorithm for computing longest common subsequences
- The Complexity of Some Problems on Subsequences and Supersequences
- Algorithms for the Longest Common Subsequence Problem
- Sparse dynamic programming I
- More Efficient Algorithm for Ordered Tree Inclusion
- Ordered and Unordered Tree Inclusion
- Approximation of RNA Multiple Structural Alignment
- Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
- An Optimal Decomposition Algorithm for Tree Edit Distance
- What Makes the Arc-Preserving Subsequence Problem Hard?
- Algorithms – ESA 2005
This page was built for publication: Finding common structured patterns in linear graphs
