Author of the publication

An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees.

, and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 754-765. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Efficient Online Algorithm for Square Detection., , and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 432-439. Springer, (2004)Algorithms for Finding a Most Similar Subforest., and . CPM, volume 4009 of Lecture Notes in Computer Science, page 377-388. Springer, (2006)Toward assessing clinical trial publications for reporting transparency., , , , , , , and . J. Biomed. Informatics, (2021)Toward Predicting Communication Effectiveness., , , , and . DSC, page 76-83. IEEE, (2018)Mobile Data Collection and Analysis in Conservation., , , , , , , , , and 1 other author(s). SMARTCOMP, page 1-5. IEEE Computer Society, (2016)An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree., and . WABI, volume 3692 of Lecture Notes in Computer Science, page 104-115. Springer, (2005)Time and Space Efficient Algorithms for Constrained Sequence Alignment., and . CIAA, volume 3317 of Lecture Notes in Computer Science, page 237-246. Springer, (2004)An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees., and . Inf. Process. Lett., 100 (4): 137-144 (2006)Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge., and . CPM, volume 4580 of Lecture Notes in Computer Science, page 195-204. Springer, (2007)Algorithms for Local Forest Similarity.. ISAAC, volume 3827 of Lecture Notes in Computer Science, page 704-713. Springer, (2005)