On the public citation graph

On-Line Linear-Time Construction of Word Suffix Trees

https://doi.org/10.1007/11780441_7
0 signed · 31 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.1007/3-540-44888-8_6openalex-snapshot
Distributed and Paged Suffix Trees for Large Genetic Databases
inferredcites →https://doi.org/10.1007/3-540-45735-6_16openalex-snapshot
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts
inferredcites →https://doi.org/10.1007/3-540-61332-3_155openalex-snapshot
Sparse suffix trees
inferredcites →https://doi.org/10.1007/978-3-540-30214-8_3openalex-snapshot
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
inferredcites →https://doi.org/10.1007/978-3-540-30219-3_39openalex-snapshot
Finding Missing Patterns
inferredcites →https://doi.org/10.1007/978-3-540-39984-1_11openalex-snapshot
Linear-Time Off-Line Text Compression by Longest-First Substitution
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/pl00009260openalex-snapshot
Suffix Trees on Words
inferredcites →https://doi.org/10.1016/s0304-3975(03)00053-7openalex-snapshot
Truncated suffix trees and their application to data compression
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1109/dcc.1996.488324openalex-snapshot
Extended application of suffix trees to data compression
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1142/s0219720004000612openalex-snapshot
EFFICIENTLY FINDING REGULATORY ELEMENTS USING CORRELATION WITH GENE EXPRESSION
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/332306.332553openalex-snapshot
Extracting structured motifs using a suffix tree—algorithms and application to promoter consensus identification
inferredcites →https://doi.org/10.1145/360825.360855openalex-snapshot
Efficient string matching

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11880561_6openalex-snapshot
Sparse Directed Acyclic Word Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-12942-2_8openalex-snapshot
A Hybrid Searchable Encryption Scheme for Cloud Computing
inferred← citeshttps://doi.org/10.1007/978-3-031-72200-4_12openalex-snapshot
Online Computation of String Net Frequency
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_17openalex-snapshot
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
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.1016/j.tcs.2008.06.017openalex-snapshot
On-line construction of compact suffix vectors and maximal repeats
inferred← citeshttps://doi.org/10.1109/ccp.2011.45openalex-snapshot
Pattern Matching on Sparse Suffix Trees
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.1587/transfun.e100.a.1785openalex-snapshot
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
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.