Pages that link to "Item:Q673642"

The following pages link to Alignment of trees -- an alternative to tree edit (Q673642):

Displaying 36 items.

• Supervised classification and mathematical optimization (Q339559) (← links)
• Forest alignment with affine gaps and anchors, applied in RNA structure comparison (Q390877) (← links)
• A survey on tree matching and XML retrieval (Q394973) (← links)
• A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
• Algorithms for finding a most similar subforest (Q538470) (← links)
• A survey on tree edit distance and related problems (Q557823) (← links)
• A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes (Q627175) (← links)
• A similarity measure for graphs with low computational complexity (Q861127) (← links)
• A theory of subtree matching and tree kernels based on the edit distance concept (Q906000) (← links)
• Comparing similar ordered trees in linear-time (Q925064) (← links)
• Space efficient algorithms for ordered tree comparison (Q930598) (← links)
• Computational methods in noncoding RNA research (Q938106) (← links)
• Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm (Q974736) (← links)
• Comparing trees via crossing minimization (Q988574) (← links)
• Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems (Q1736602) (← links)
• Compositional properties of alignments (Q2071523) (← links)
• Graph comparison via nonlinear quantum search (Q2105947) (← links)
• Comparing and distinguishing the structure of biological branching (Q2351339) (← links)
• Tai mapping hierarchy for rooted labeled trees through common subforest (Q2398215) (← links)
• Algorithms for local similarity between forests (Q2436665) (← links)
• Selected tree classifier combination based on both accuracy and error diversity (Q2485044) (← links)
• Data mining in an engineering design environment: OR applications from graph matching (Q2499148) (← links)
• An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
• Decomposition algorithms for the tree edit distance problem (Q2569420) (← links)
• Algebraic dynamic programming on trees (Q2633220) (← links)
• Forest Alignment with Affine Gaps and Anchors (Q3011847) (← links)
• Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees (Q3011871) (← links)
• Comparative Assessment of Alignment Algorithms for NGS Data: Features, Considerations, Implementations, and Future (Q3305532) (← links)
• Counting, Generating, Analyzing and Sampling Tree Alignments (Q4683230) (← links)
• FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees (Q5075834) (← links)
• A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression. (Q5090362) (← links)
• Alignment distance of regular tree languages (Q5919581) (← links)
• Alignment distance of regular tree languages (Q5920054) (← links)
• Finding similar consensus between trees: An algorithm and a distance hierarchy (Q5926038) (← links)
• Identifying consensus of trees through alignment (Q5938834) (← links)
• On the complexity of comparing evolutionary trees (Q5961623) (← links)