Efficient chaining of seeds in ordered trees

Type: Article

Publication Date: 2011-12-15

Citations: 3

DOI: https://doi.org/10.1016/j.jda.2011.12.013

Locations

  • Journal of Discrete Algorithms - View
  • arXiv (Cornell University) - View - PDF
  • HAL (Le Centre pour la Communication Scientifique Directe) - View - PDF
  • DataCite API - View

Similar Works

Action Title Year Authors
+ PDF Chat Efficient chaining of seeds in ordered trees 2010 Julien Allali
Cédric Chauve
Pascal Ferraro
Anne-Laure Gaillard
+ PDF Chat Efficient Chaining of Seeds in Ordered Trees 2011 Julien Allali
Cédric Chauve
Pascal Ferraro
Anne-Laure Gaillard
+ Paths in ordered trees 2018 Keith Copenhaver
+ Lexicographically ordered trees 2004 Will Funk
David Lutzer
+ A Gray Code of Ordered Trees 2024 Shin-ichi Nakano
+ Ordered Chaining for Total Orderings 1994 Leo Bachmair
Harald Ganzinger
+ Efficient generation of binary trees from inorder-postorder sequences 1986 M. C. Er
+ Ordering trees by $$\alpha $$-index 2023 Diego de Souza Maceira Belay
Celso M. da Silva
Maria Aguieiras A. de Freitas
+ Packing in trees 1998 Michael A. Henning
+ Ordered trees and non-crossing partitions 1986 Nachum Dershowitz
Shmuel Zaks
+ Generating all maximal independent sets on trees in lexicographic order 1994 Yizhe Chang
J.S. Wang
R. C. T. Lee
+ The uplift principle for ordered trees 2011 Gi‐Sang Cheon
Louis W. Shapiro
+ Weakly Protected Points in Ordered Trees 2021 Lin Yang
Sheng-Liang Yang
+ Enumeration of Trees 1963 O. Wing
+ PDF Chat On ordering vertices of infinite trees 1966 František Neuman
+ ORDERED STRUCTURES 1967 L. Rédei
+ A pairing of the vertices of ordered trees 2001 Seunghyun Seo
+ PDF Chat Enumeration of Unordered Forests 2021 Florian Ingels
Romain Azaïs
+ PDF Chat Enumeration of Unordered Forests 2020 Florian Ingels
Romain Azaïs
+ PDF Chat Enumeration of Unordered Forests 2021 Florian Ingels
Romain Azaïs

Works That Cite This (0)

Action Title Year Authors