On the public citation graph
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing
0 signed · 41 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11575832_9openalex-snapshot
Towards Real-Time Suffix Tree Construction
inferredcites →https://doi.org/10.1007/3-540-44888-8_14openalex-snapshot
Linear-Time Construction of Suffix Arrays
inferredcites →https://doi.org/10.1007/3-540-44888-8_15openalex-snapshot
Space Efficient Linear Time Construction of Suffix Arrays
inferredcites →https://doi.org/10.1007/3-540-45061-0_73openalex-snapshot
Simple Linear Work Suffix Array Construction
inferredcites →https://doi.org/10.1007/3-540-48523-6_34openalex-snapshot
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-030-36826-5_4openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_52openalex-snapshot
A General Technique for Managing Strings in Comparison-Driven Data Structures
inferredcites →https://doi.org/10.1007/978-3-642-69672-5openalex-snapshot
Data Structures and Algorithms 1
inferredcites →https://doi.org/10.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferredcites →https://doi.org/10.1016/j.jda.2004.08.002openalex-snapshot
Space efficient linear time construction of suffix arrays
inferredcites →https://doi.org/10.1016/j.jda.2004.08.019openalex-snapshot
Constructing suffix arrays in linear time
inferredcites →https://doi.org/10.1016/s1570-8667(03)00065-0openalex-snapshot
Replacing suffix trees with enhanced suffix arrays
inferredcites →https://doi.org/10.1109/sfcs.1997.646102openalex-snapshot
Optimal suffix tree construction with large alphabets
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/1217856.1217858openalex-snapshot
Linear work suffix array construction
inferredcites →https://doi.org/10.1145/28395.28434openalex-snapshot
Two algorithms for maintaining order in a list
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/355541.355547openalex-snapshot
On the sorting-complexity of suffix tree construction
inferredcites →https://doi.org/10.5555/644108.644251openalex-snapshot
Multidimensional matching and fast search in suffix trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470892107.ch1openalex-snapshot
String Data Structures for Computational Molecular Biology
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_109openalex-snapshot
Dictionary Matching and Indexing (Exact and with Errors)
inferred← citeshttps://doi.org/10.1007/978-3-030-75836-3_13openalex-snapshot
Sequential Representation of Suffix Trie: An Empirical Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_17openalex-snapshot
String Matching with a Dynamic Pattern
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_14openalex-snapshot
Alphabet-Dependent String Searching with Wexponential Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_16openalex-snapshot
An(other) Entropy-Bounded Compressed Suffix Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_18openalex-snapshot
Indexing a Dictionary for Subset Matching Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-12476-1_11openalex-snapshot
Indexing a Dictionary for Subset Matching Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_7openalex-snapshot
The Property Suffix Tree with Dynamic Properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.09.012openalex-snapshot
Faster entropy-bounded compressed suffix trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.001openalex-snapshot
On demand string sorting over unbounded alphabets
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.033openalex-snapshot
The property suffix tree with dynamic properties
inferred← citeshttps://doi.org/10.1137/110836377openalex-snapshot
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing
inferred← citeshttps://doi.org/10.1504/ijcbdd.2008.020190openalex-snapshot
CLUSS2: an alignment-independent algorithm for clustering protein families with multiple biological functions
inferred← citeshttps://doi.org/10.1515/bpasts-2017-0046openalex-snapshot
Compact and hash based variants of the suffix array
inferred← citeshttps://doi.org/10.5821/dissertation-2117-113295openalex-snapshot
Efficient approximate string matching techniques for sequence alignment
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.