Approximate labelled subtree homeomorphism
From MaRDI portal
Publication:1018101
DOI10.1016/j.jda.2007.07.001zbMath1160.90680OpenAlexW2091828646MaRDI QIDQ1018101
Michal Ziv-Ukelson, Oleg Rokhlenko, Dekel Tsur, Ron Yair Pinter
Publication date: 13 May 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2007.07.001
Related Items (6)
An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem ⋮ On retracts, absolute retracts, and foldings in cographs ⋮ Algorithms for topology-free and alignment network queries ⋮ Homeomorphic alignment of weighted trees ⋮ Partial information network queries ⋮ An algebraic view of the relation between largest common subtrees and smallest common supertrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On a cyclic string-to-string correction problem
- Subtree isomorphism is in random NC
- Subtree isomorphism is NC reducible to bipartite perfect matching
- Kaikoura tree theorems: Computing the maximum agreement subtree
- Clique partitions, graph compression and speeding-up algorithms
- Constrained Tree Inclusion
- O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
- Sublinear-Time Parallel Algorithms for Matching and Related Problems
- A linear space algorithm for computing maximal common subsequences
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- An Analysis of a Good Algorithm for the Subtree Problem
- Subtree Isomorphism in O(n5/2)
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
- Faster Scaling Algorithms for Network Problems
- Ordered and Unordered Tree Inclusion
- Faster Subtree Isomorphism
- Fibonacci heaps and their uses in improved network optimization algorithms
- Combinatorial Pattern Matching
This page was built for publication: Approximate labelled subtree homeomorphism
