A suffix tree or not a suffix tree? (Q2343297): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||||||||||||||
(7 intermediate revisions by 6 users not shown) | |||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
A Suffix Tree Or Not a Suffix Tree? | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article | scientific article; zbMATH DE number 6482483 | ||||||||||||||
Property / title | |||||||||||||||
A Suffix Tree Or Not a Suffix Tree? (English) | |||||||||||||||
Property / title: A Suffix Tree Or Not a Suffix Tree? (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1401.68054 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1007/978-3-319-19315-1_30 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Lecture Notes in Computer Science / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
15 September 2015
| |||||||||||||||
Property / publication date: 15 September 2015 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 68R15 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 6482483 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / MaRDI profile type | |||||||||||||||
Property / MaRDI profile type: MaRDI publication profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2094777380 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2296161788 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / arXiv ID | |||||||||||||||
Property / arXiv ID: 1403.1364 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Forty Years of Text Indexing / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On suffix extensions in suffix trees / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: REVERSE ENGINEERING PREFIX TABLES / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Cover Array String Reconstruction / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q3370008 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Efficient validation and construction of border arrays and validation of string matching automata / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Words over an ordered alphabet and suffix permutations / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Validating the Knuth-Morris-Pratt failure function, fast and online / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Algorithms on Strings, Trees and Sequences / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Counting Parameterized Border Arrays for a Binary Alphabet / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Verifying a Parameterized Border Array in O(n 1.5) Time / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Verifying and enumerating parameterized border arrays / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Inferring strings from suffix trees and links on a binary alphabet / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On the combinatorics of suffix arrays / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4795855 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On-line construction of suffix trees / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Reverse engineering of compact suffix trees and links: a novel algorithm / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A suffix tree or not a suffix tree? / rank | |||||||||||||||
Normal rank | |||||||||||||||
links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 18:15, 10 July 2024
scientific article; zbMATH DE number 6482483
- A Suffix Tree Or Not a Suffix Tree?
Language | Label | Description | Also known as |
---|---|---|---|
English | A suffix tree or not a suffix tree? |
scientific article; zbMATH DE number 6482483 |
|
Statements
A suffix tree or not a suffix tree? (English)
0 references
A Suffix Tree Or Not a Suffix Tree? (English)
0 references
4 May 2015
0 references
15 September 2015
0 references
reverse engineering
0 references
suffix trees
0 references
suffix links
0 references
suffix tour graphs
0 references
0 references