Efficient chaining of seeds in ordered trees

DOI10.1016/j.jda.2011.12.013zbMath1316.68209OpenAlexW2176745125MaRDI QIDQ450556

Julien Allali, Cedric Chauve, Pascal Ferraro, Anne-Laure Gaillard

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.013

zbMATH Keywords

seedsordered treeschaining

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Applications of graph theory (05C90) Genetics and epigenetics (92D10) Algorithms on strings (68W32)

Related Items (1)

Efficient Chaining of Seeds in Ordered Trees

Cites Work

• Unnamed Item
• An optimal decomposition algorithm for tree edit distance
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Bioinformatics Algorithms
• The Tree-to-Tree Correction Problem
• Algorithms on Strings, Trees and Sequences
• Determining DNA sequence similarity using maximum independent set algorithms for interval graphs

This page was built for publication: Efficient chaining of seeds in ordered trees