scientific article; zbMATH DE number 1786457

MaRDI QIDQ4547748zbMATHFDO

Authors Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, S. Arikawa

Publication date 21 August 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2089/20890169

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Recommendations

• On-line construction of compact directed acyclic word graphs
• Implementation of directed acyclic word graph.
• scientific article; zbMATH DE number 1929950
• scientific article; zbMATH DE number 1962785
• Combinatorial Pattern Matching

Cited in

(19)

• Compact directed acyclic word graphs for a sliding window
• Representing the suffix tree with the CDAWG
• scientific article; zbMATH DE number 1962793 (Why is no real title available?)
• Compact morphic directed acyclic word graphs
• Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
• Combinatorial Pattern Matching
• Compressed directed acyclic word graph with application in local alignment
• Compressed directed acyclic word graph with application in local alignment
• scientific article; zbMATH DE number 1929950 (Why is no real title available?)
• Weighted automata for full-text indexing
• On-line construction of compact directed acyclic word graphs
• Fast label extraction in the CDAWG
• On the Structure of Consistent Partitions of Substring Set of a Word
• On Sturmian graphs
• Ternary directed acyclic word graphs
• Fully-online suffix tree and directed acyclic word graph construction for multiple texts
• How much is that DAWG in the window? a moving window algorithm for the directed acyclic word graph
• Linear-size suffix tries
• Implementation of directed acyclic word graph.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547748)