On the public citation graph
Efficient implementation of lazy suffix trees
0 signed · 141 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.1002/(sici)1097-024x(199911)29:13<1149::aid-spe274>3.0.co;2-oopenalex-snapshot
Reducing the space requirement of suffix trees
inferredcites →https://doi.org/10.1002/spe.4380100608openalex-snapshot
Practical fast searching in strings
inferredcites →https://doi.org/10.1002/spe.4380250203openalex-snapshot
Efficient implementation of suffix trees
inferredcites →https://doi.org/10.1007/3-540-47849-3_18openalex-snapshot
Factor Oracle: A New Structure for Pattern Matching
inferredcites →https://doi.org/10.1007/3-540-48318-7_5openalex-snapshot
Efficient Implementation of Lazy Suffix Trees
inferredcites →https://doi.org/10.1007/3-540-60044-2_43openalex-snapshot
Suffix cactus: A cross between suffix tree and suffix array
inferredcites →https://doi.org/10.1007/978-3-540-49382-2_17openalex-snapshot
Space Efficient 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/bf01762122openalex-snapshot
Parallel construction of a suffix tree with applications
inferredcites →https://doi.org/10.1007/pl00009177openalex-snapshot
From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction
inferredcites →https://doi.org/10.1016/0020-0190(96)00061-0openalex-snapshot
A time and space efficient data structure for string searching on large texts
inferredcites →https://doi.org/10.1016/0167-6423(95)00003-8openalex-snapshot
A comparison of imperative and purely functional suffix tree constructions
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1038/35057062openalex-snapshot
Initial sequencing and analysis of the human genome
inferredcites →https://doi.org/10.1093/nar/11.13.4629openalex-snapshot
An efficient method for finding repeats in molecular sequences
inferredcites →https://doi.org/10.1093/nar/29.22.4633openalex-snapshot
REPuter: the manifold applications of repeat analysis on a genomic scale
inferredcites →https://doi.org/10.1093/nar/29.22.4643openalex-snapshot
Prediction of DNA single-strand conformation polymorphism: analysis by capillary electrophoresis and computerized DNA modeling
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/333623.333627openalex-snapshot
Who is interested in algorithms and why?
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.5555/313852.314087openalex-snapshot
Efficient suffix trees on secondary storage
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.698openalex-snapshot
Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem
inferred← citeshttps://doi.org/10.1002/spe.960openalex-snapshot
A survey of practical algorithms for suffix tree construction in external memory
inferred← citeshttps://doi.org/10.1007/11430919_26openalex-snapshot
A Novel Indexing Method for Efficient Sequence Matching in Large DNA Database Environment
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_414openalex-snapshot
Suffix Tree Construction in RAM
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_414openalex-snapshot
Suffix Tree Construction
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_34openalex-snapshot
Efficient Representation for Online Suffix Tree Construction
inferred← citeshttps://doi.org/10.1007/978-3-319-59826-0_2openalex-snapshot
Full-Text Indexes for High-Throughput Sequencing
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_32openalex-snapshot
Compressed Compact Suffix Arrays
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_30openalex-snapshot
Text Searching: Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_19openalex-snapshot
Dynamic Fully-Compressed Suffix Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-70600-7_5openalex-snapshot
Fast Structured Motif Search in DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-70720-2_29openalex-snapshot
Efficient String Mining under Constraints Via the Deferred Frequency Index
inferred← citeshttps://doi.org/10.1007/978-3-540-71233-6_36openalex-snapshot
Efficient and Scalable Indexing Techniques for Biological Sequence Data
inferred← citeshttps://doi.org/10.1007/978-3-540-71701-0_103openalex-snapshot
A Practical Method for Approximate Subsequence Search in DNA Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_32openalex-snapshot
Fully-Compressed Suffix Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-87361-7_26openalex-snapshot
Fast and Adaptive Variable Order Markov Chain Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-12476-1_8openalex-snapshot
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_31openalex-snapshot
Parallel and Distributed Compressed Indexes
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_414-2openalex-snapshot
Suffix Tree Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-55195-6_25openalex-snapshot
A Parallel, Distributed-Memory Framework for Comparative Motif Discovery
inferred← citeshttps://doi.org/10.1007/s00778-005-0154-8openalex-snapshot
Practical methods for constructing suffix trees
inferred← citeshttps://doi.org/10.1007/s00779-012-0569-3openalex-snapshot
Efficient techniques on retrieving bio-information for active U-healthcare
inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.022openalex-snapshot
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.12.012openalex-snapshot
Computing suffix links for suffix trees and arrays
inferred← citeshttps://doi.org/10.1016/j.jda.2004.08.003openalex-snapshot
Indexing text with approximate q-grams
inferred← citeshttps://doi.org/10.1016/j.jda.2012.01.001openalex-snapshot
On-line suffix tree construction with reduced branching
inferred← citeshttps://doi.org/10.1016/j.mcp.2016.12.004openalex-snapshot
WITHDRAWN: Designing and computational validation of microarray probe sets for the diagnosis of viruses of non-human vertebrates
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.013openalex-snapshot
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
inferred← citeshttps://doi.org/10.1016/s0950-5849(02)00158-1openalex-snapshot
Efficient storage and querying of sequential patterns in database systems⋆
inferred← citeshttps://doi.org/10.1093/bioinformatics/btk041openalex-snapshot
GUUGle: a utility for fast exact matching under RNA complementary rules including G–U base pairing
inferred← citeshttps://doi.org/10.1093/bioinformatics/btm200openalex-snapshot
Optimized design and assessment of whole genome tiling arrays
inferred← citeshttps://doi.org/10.1093/bioinformatics/btp112openalex-snapshot
mkESA: enhanced suffix array construction tool
inferred← citeshttps://doi.org/10.1093/bioinformatics/btq231openalex-snapshot
Semantic integration of data on transcriptional regulation
inferred← citeshttps://doi.org/10.1093/nar/gki896openalex-snapshot
Draft versus finished sequence data for DNA and protein diagnostic signature development
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.1093/nar/gkt005openalex-snapshot
Fast and accurate read mapping with approximate seeds and multiple backtracking
inferred← citeshttps://doi.org/10.1109/bibe.2007.4375711openalex-snapshot
A Suffix Tree Construction Algorithm for DNA Sequences
inferred← citeshttps://doi.org/10.1109/bibe.2011.48openalex-snapshot
Constructing Suffix Tree of Endogenous Feature on FPGA for High-Performance Identification of DNA Signatures
inferred← citeshttps://doi.org/10.1109/dcc.2014.40openalex-snapshot
Fast Fully-Compressed Suffix Trees
inferred← citeshttps://doi.org/10.1109/icde.2006.47openalex-snapshot
Declarative Querying for Biological Sequences
inferred← citeshttps://doi.org/10.1109/iiswc.2014.6983062openalex-snapshot
An analysis of address and branch patterns with PatternFinder
inferred← citeshttps://doi.org/10.1109/indin.2017.8104881openalex-snapshot
Unsupervised mode detection in cyber-physical systems using variable order Markov models
inferred← citeshttps://doi.org/10.1109/ipdps.2005.204openalex-snapshot
ESTmapper: Efficiently Aligning DNA Sequences to Genomes
inferred← citeshttps://doi.org/10.1109/isit.2013.6620561openalex-snapshot
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
inferred← citeshttps://doi.org/10.1109/tkde.2005.3openalex-snapshot
Constructing suffix tree for gigabyte sequences with megabyte memory
inferred← citeshttps://doi.org/10.1128/jcm.42.12.5472-5476.2004openalex-snapshot
Sequencing Needs for Viral Diagnostics
inferred← citeshttps://doi.org/10.1128/jcm.43.4.1807-1817.2005openalex-snapshot
System To Assess Genome Sequencing Needs for Viral Protein Diagnostics and Therapeutics
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.1142/9789812776136_0011openalex-snapshot
TRELLIS+: AN EFFECTIVE APPROACH FOR INDEXING GENOME-SCALE SEQUENCES USING SUFFIX TREES
inferred← citeshttps://doi.org/10.1145/1099554.1099579openalex-snapshot
Exact match search in sequence data using suffix trees
inferred← citeshttps://doi.org/10.1145/1186810.1186816openalex-snapshot
A data structure for a sequence of string accesses in external memory
inferred← citeshttps://doi.org/10.1145/1247480.1247572openalex-snapshot
Genome-scale disk-based suffix tree indexing
inferred← citeshttps://doi.org/10.1145/1451940.1451972openalex-snapshot
Improved count suffix trees for natural language data
inferred← citeshttps://doi.org/10.1145/1739041.1739075openalex-snapshot
Suffix tree construction algorithms on modern hardware
inferred← citeshttps://doi.org/10.1145/1871437.1871529openalex-snapshot
Result-size estimation for information-retrieval subqueries
inferred← citeshttps://doi.org/10.1145/1963190.1963191openalex-snapshot
Indexing methods for approximate dictionary searching
inferred← citeshttps://doi.org/10.1145/2000807.2000821openalex-snapshot
Fully compressed suffix trees
inferred← citeshttps://doi.org/10.1145/2457317.2457386openalex-snapshot
Scalable string similarity search/join with approximate seeds and multiple backtracking
inferred← citeshttps://doi.org/10.1145/2661653openalex-snapshot
A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction
inferred← citeshttps://doi.org/10.1145/3018787openalex-snapshot
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
inferred← citeshttps://doi.org/10.1145/3018787.3018791openalex-snapshot
Internally Deterministic Parallelism: Techniques and Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018792openalex-snapshot
Deterministic Parallelism in Sequential Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018793openalex-snapshot
A Deterministic Phase-Concurrent Parallel Hash Table
inferred← citeshttps://doi.org/10.1145/3018787.3018794openalex-snapshot
Priority Updates: A Contention-Reducing Primitive for Deterministic Programming
inferred← citeshttps://doi.org/10.1145/3018787.3018795openalex-snapshot
Ligra: A Lightweight Graph Processing Framework for Shared Memory
inferred← citeshttps://doi.org/10.1145/3018787.3018796openalex-snapshot
Ligra+: Adding Compression to Ligra
inferred← citeshttps://doi.org/10.1145/3018787.3018797openalex-snapshot
Linear-Work Parallel Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3018787.3018798openalex-snapshot
Parallel and Cache-Oblivious Triangle Computations
inferred← citeshttps://doi.org/10.1145/3018787.3018799openalex-snapshot
Parallel Cartesian Tree and Suffix Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018800openalex-snapshot
Parallel Computation of Longest Common Prefixes
inferred← citeshttps://doi.org/10.1145/3018787.3018801openalex-snapshot
Parallel Lempel-Ziv Factorization
inferred← citeshttps://doi.org/10.1145/3018787.3018802openalex-snapshot
Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1145/3386901.3396605openalex-snapshot
Deduplicating future data transfer using data exchanged in the past to decrease mobile bandwidth usage
inferred← citeshttps://doi.org/10.1177/0165551506059229openalex-snapshot
An efficient approach for sequence matching in large DNA databases
inferred← citeshttps://doi.org/10.1177/0165551506062329openalex-snapshot
An efficient DNA sequence searching method using position specific weighting scheme
inferred← citeshttps://doi.org/10.1186/1471-2105-9-11openalex-snapshot
SeqAn An efficient, generic C++ library for sequence analysis
inferred← citeshttps://doi.org/10.1186/1471-2164-11-668openalex-snapshot
A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.1186/1748-7188-1-22openalex-snapshot
SMOTIF: efficient structured pattern and profile motif search.
inferred← citeshttps://doi.org/10.1186/1752-0509-5-7openalex-snapshot
BiologicalNetworks - tools enabling the integration of multi-scale data for the host-pathogen studies
inferred← citeshttps://doi.org/10.1186/s12859-021-04387-yopenalex-snapshot
Fast parallel construction of variable-length Markov chains
inferred← citeshttps://doi.org/10.12720/jait.7.4.281-286openalex-snapshot
Using Frequent Substring Mining Techniques for Indexing Genome Sequences: A Comparison of Frequent Substring and Frequent Max Substring Algorithms
inferred← citeshttps://doi.org/10.1371/journal.pone.0073455openalex-snapshot
Detection of Bacillus anthracis DNA in Complex Soil and Air Samples Using Next-Generation Sequencing
inferred← citeshttps://doi.org/10.1504/ijbra.2008.017165openalex-snapshot
The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1750openalex-snapshot
Lazy Suffix Array: The Data Structure for Online Construction and Pattern Searching
inferred← citeshttps://doi.org/10.1587/transinf.e94.d.1369openalex-snapshot
A Fast Divide-and-Conquer Algorithm for Indexing Human Genome Sequences
inferred← citeshttps://doi.org/10.2200/s00396ed1v01y201111dtm022openalex-snapshot
Full-Text (Substring) Indexes in External Memory
inferred← citeshttps://doi.org/10.23860/diss-ozturk-celal-2013openalex-snapshot
Analyzing and Quantifying Dynamc Program Behavior in Terms of Regularities and Patterns
inferred← citeshttps://doi.org/10.33915/etd.3402openalex-snapshot
Suffix Structures and Circular Pattern Problems
inferred← citeshttps://doi.org/10.5445/ir/1000085031openalex-snapshot
Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
inferred← citeshttps://doi.org/10.5772/6339openalex-snapshot
A Partition-Based Suffix Tree Construction and Its Applications
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434129openalex-snapshot
Additional file 10 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434132openalex-snapshot
Additional file 11 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434135openalex-snapshot
Additional file 12 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434138openalex-snapshot
Additional file 1 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434141openalex-snapshot
Additional file 2 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434144openalex-snapshot
Additional file 3 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434147openalex-snapshot
Additional file 4 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434150openalex-snapshot
Additional file 5 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434153openalex-snapshot
Additional file 6 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434156openalex-snapshot
Additional file 7 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434159openalex-snapshot
Additional file 8 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434162openalex-snapshot
Additional file 9 of A microbial detection array (MDA) for viral and bacterial detection
inferred← citeshttps://doi.org/10.6084/m9.figshare.14434165openalex-snapshot
Additional file of A microbial detection array (MDA) for viral and bacterial detection
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.