Efficient Chaining of Seeds in Ordered Trees

DOI10.1007/978-3-642-19222-7_27zbMath1326.05031arXiv1007.0942OpenAlexW2038351187MaRDI QIDQ3000514

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

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.0942

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Efficient chaining of seeds in ordered trees
• Chaining algorithms for multiple genome comparison
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Algorithms on Strings, Trees and Sequences
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Chaining of Seeds in Ordered Trees