On the public citation graph

Suffix Trees on Words

https://doi.org/10.1007/pl00009260
0 signed · 48 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/spe.4380250203openalex-snapshot
Efficient implementation of suffix trees
inferredcites →https://doi.org/10.1006/jcss.1998.1580openalex-snapshot
Sorting in Linear Time?
inferredcites →https://doi.org/10.1007/3-540-61332-3_155openalex-snapshot
Sparse suffix trees
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
inferredcites →https://doi.org/10.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferredcites →https://doi.org/10.1007/bfb0035751openalex-snapshot
Efficient text searching of regular expressions
inferredcites →https://doi.org/10.1007/bfb0049399openalex-snapshot
Faster searching in tries and quadtrees—An analysis of level compression
inferredcites →https://doi.org/10.1016/0020-0190(93)90068-kopenalex-snapshot
Improved behaviour of tries by adaptive branching
inferredcites →https://doi.org/10.1016/0022-0000(93)90040-4openalex-snapshot
Surpassing the information theoretic bound with fusion trees
inferredcites →https://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferredcites →https://doi.org/10.1109/sfcs.1996.548472openalex-snapshot
Faster deterministic sorting and searching in linear space
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/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/0222070openalex-snapshot
A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11577935_11openalex-snapshot
Personalisation of Web Search
inferred← citeshttps://doi.org/10.1007/11780441_7openalex-snapshot
On-Line Linear-Time Construction of Word Suffix Trees
inferred← citeshttps://doi.org/10.1007/11880561_6openalex-snapshot
Sparse Directed Acyclic Word Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_5openalex-snapshot
Fast Lightweight Suffix Array Construction and Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-30214-8_3openalex-snapshot
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
inferred← citeshttps://doi.org/10.1007/978-3-540-30219-3_39openalex-snapshot
Finding Missing Patterns
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_33openalex-snapshot
Suffix Arrays on Words
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_22openalex-snapshot
Sparse and Truncated Suffix Trees on Variable-Length Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-22825-4_5openalex-snapshot
A New Algorithm for Sparse Suffix Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_13openalex-snapshot
Sparse Suffix Tree Construction in Small Space
inferred← citeshttps://doi.org/10.1007/s007780200064openalex-snapshot
Database indexing for large DNA and protein sequence collections
inferred← citeshttps://doi.org/10.1007/s10961-011-9231-xopenalex-snapshot
Redeploying Bayh-Dole: beyond Merely doing good to optimizing the potential in results of taxpayer-funded research
inferred← citeshttps://doi.org/10.1016/j.ipm.2011.08.004openalex-snapshot
Evaluating subtopic retrieval methods: Clustering versus diversification of search results
inferred← citeshttps://doi.org/10.1016/j.jda.2004.08.004openalex-snapshot
Distributed suffix trees
inferred← citeshttps://doi.org/10.1016/j.jda.2010.08.005openalex-snapshot
Missing pattern discovery
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00034-0openalex-snapshot
The suffix binary search tree and suffix AVL tree
inferred← citeshttps://doi.org/10.1093/nar/gks408openalex-snapshot
Prospects and limitations of full-text index structures in genome analysis
inferred← citeshttps://doi.org/10.1109/cibcb.2007.4221216openalex-snapshot
An ACGT-Words Tree for Efficient Data Access in Genomic Databases
inferred← citeshttps://doi.org/10.1109/wi-iat.2009.37openalex-snapshot
Full-Subtopic Retrieval with Keyphrase-Based Search Results Clustering
inferred← citeshttps://doi.org/10.1137/s0097539702402354openalex-snapshot
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
inferred← citeshttps://doi.org/10.1145/1217856.1217858openalex-snapshot
Linear work suffix array construction
inferred← citeshttps://doi.org/10.1145/1871437.1871527openalex-snapshot
Index structures for efficiently searching natural language text
inferred← citeshttps://doi.org/10.1145/2361354.2361404openalex-snapshot
Full-text search on multi-byte encoded documents
inferred← citeshttps://doi.org/10.1145/2836166openalex-snapshot
Sparse Text Indexing in Small Space
inferred← citeshttps://doi.org/10.1145/335305.335351openalex-snapshot
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
inferred← citeshttps://doi.org/10.3115/1118693.1118730openalex-snapshot
Processing comparable corpora with Bilingual Suffix Trees
inferred← citeshttps://doi.org/10.3233/wia-2011-0222openalex-snapshot
Full discrimination of subtopics in search results with keyphrase-based clustering
inferred← citeshttps://doi.org/10.4225/03/59d42da95f042openalex-snapshot
Efficient computational approach to identifying overlapping documents in large digital collections
inferred← citeshttps://doi.org/10.48550/arxiv.0801.2378openalex-snapshot
String algorithms and data structures
inferred← citeshttps://doi.org/10.5282/edoc.7505openalex-snapshot
Data Structures for Efficient String Algorithms
inferred← citeshttps://doi.org/10.7939/r3gq6qopenalex-snapshot
Indexing and Querying Natural Language Text
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.