Finding common structured patterns in linear graphs

Authors:
Guillaume Fertin;Danny Hermelin;Romeo Rizzi;Stéphane Vialette
Affiliations:
LINA, CNRS UMR 6241, Université de Nantes, 2 rue de la Houssinière, 44322 Nantes, France;Department of Computer Science, University of Haifa, Mount Carmel, Haifa 31905, Israel;DIMI, Università degli Studi di Udine, Via delle Scienze, 208 I-33100 Udine (UD), Italy;LIGM, CNRS UMR 8049, Université Paris-Est Marne-la-Vallée, 5 Bd Descartes 77454 Marne-la-Vallée, France
Venue:
Theoretical Computer Science
Year:
2010

Citing 22
Cited 0

Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs

Information Processing Letters
Sparse dynamic programming I: linear cost functions

Journal of the ACM (JACM)
Ordered and Unordered Tree Inclusion

SIAM Journal on Computing
Covering and coloring polygon-circle graphs

Discrete Mathematics
More efficient algorithm for ordered tree inclusion

Journal of Algorithms
Pattern matching for permutations

Information Processing Letters
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences

Communications of the ACM
Pattern Matching for Arc-Annotated Sequences

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On the Tree Inclusion Problem

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Algorithmic Aspects of Protein Structure Similarity

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the computational complexity of 2-interval pattern matching problems

Theoretical Computer Science
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A computational model for RNA multiple structural alignment

Theoretical Computer Science
Extracting constrained 2-interval subsets in 2-interval sets

Theoretical Computer Science
On two open problems of 2-interval patterns

Theoretical Computer Science
Approximation of RNA multiple structural alignment

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Longest common subsequences in permutations and maximum cliques in circle graphs

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
An optimal decomposition algorithm for tree edit distance

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	5.23

Visualization

Abstract

A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (