Alignment of trees -- an alternative to tree edit
From MaRDI portal
Publication:673642
DOI10.1016/0304-3975(95)80015-8zbMATH Open0873.68150OpenAlexW2147828873MaRDI QIDQ673642FDOQ673642
Authors: Tao Jiang, Lusheng Wang, Kaizhong Zhang 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)80015-8
Recommendations
- Theoretical Computer Science
- A More Efficient Approximation Scheme for Tree Alignment
- Identifying consensus of trees through alignment
- scientific article; zbMATH DE number 1998340
- scientific article; zbMATH DE number 1786462
- Homeomorphic Alignment of Edge-Weighted Trees
- Tree edit distance and maximum agreement subtree
- Improved Approximation Algorithms for Tree Alignment
- The Bottleneck Tree Alignment Problems
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Optimization, approximation, and complexity classes
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- The Tree-to-Tree Correction Problem
- Title not available (Why is that?)
- Some MAX SNP-hard results concerning unordered labeled trees
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Title not available (Why is that?)
- On the editing distance between unordered labeled trees
- Threshold decomposition of gray-scale morphology into binary morphology
- A Tree-to-Tree Distance and Its Application to Cluster Analysis
Cited In (58)
- Improving strategic decisions in sequential games by exploiting positional similarity
- Identifying consensus of trees through alignment
- Forest alignment with affine gaps and anchors, applied in RNA structure comparison
- A survey on tree matching and XML retrieval
- Comparative assessment of alignment algorithms for NGS data: features, considerations, implementations, and future
- Algorithms for local similarity between forests
- Graph comparison via nonlinear quantum search
- Algorithms for finding a most similar subforest
- Supervised classification and mathematical optimization
- Improved MAX SNP-hard results for finding an edit distance between unordered trees
- Efficient exponential time algorithms for edit distance between unordered trees
- A metric for rooted trees with unlabeled vertices based on nested parentheses
- A similarity measure for graphs with low computational complexity
- Finding similar consensus between trees: An algorithm and a distance hierarchy
- Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
- Comparing similar ordered trees in linear-time
- Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Ordered tree alignment with genetic programming
- Title not available (Why is that?)
- A survey on tree edit distance and related problems
- On the expressivity of alignment-based distance and similarity measures on sequences and trees in inducing orderings
- Counting, Generating, Analyzing and Sampling Tree Alignments
- Algorithms and Computation
- Selected tree classifier combination based on both accuracy and error diversity
- Comparing trees via crossing minimization
- Comparing and distinguishing the structure of biological branching
- A constrained edit distance algorithm between semi-ordered trees
- A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
- Caterpillar alignment distance for rooted labeled caterpillars: distance based on alignments required to be caterpillars
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Decomposition algorithms for the tree edit distance problem
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Data mining in an engineering design environment: OR applications from graph matching
- New algorithm for ordered tree-to-tree correction problem
- Computer Vision - ECCV 2004
- Exact algorithms for computing the tree edit distance between unordered trees
- Numerical similarity and dissimilarity measures between two trees
- Combinatorial Pattern Matching
- Forest Alignment with Affine Gaps and Anchors
- FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
- A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes
- A theory of subtree matching and tree kernels based on the edit distance concept
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems
- A VLSI algorithm for calculating the tree to tree distance
- Tai mapping hierarchy for rooted labeled trees through common subforest
- A More Efficient Approximation Scheme for Tree Alignment
- Compositional properties of alignments
- Space efficient algorithms for ordered tree comparison
- Tractable and intractable variations of unordered tree edit distance
- Alignment distance of regular tree languages
- Alignment distance of regular tree languages
- On the complexity of comparing evolutionary trees
- Computational methods in noncoding RNA research
- Algebraic dynamic programming on trees
- Theoretical Computer Science
This page was built for publication: Alignment of trees -- an alternative to tree edit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673642)
