Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Handbook of Computational Molecular Biology (Chapman & All/Crc Computer and Information Science Series)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An optimal decomposition algorithm for tree edit distance
ACM Transactions on Algorithms (TALG)
Novel definition and algorithm for chaining fragments with proportional overlaps
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Hi-index | 0.00 |
We consider the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non-overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem is a natural extension of a similar problem for sequences, and has applications in computational biology, such as mining a database of RNA secondary structures. For the chaining problem with a set S of m seeds of cumulated size @?S@?, we describe an algorithm with complexity O(@?S@?log(@?S@?)+m@?S@?log(m)) in time and O(m@?S@?) in space.