BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
tree (32)
construct (17)
word (8)
array (7)
string (7)

Stem suffix$ (all stems)

56 papers:

CIAACIAA-2015-Giaquinta #automaton #nondeterminism
Run-Length Encoded Nondeterministic KMP and Suffix Automata (EG), pp. 102–113.
LATALATA-2015-CazauxLR #assembly #graph
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (BC, TL, ER), pp. 109–120.
DLTDLT-J-2013-BonomoMRRS14 #multi #sorting #word
Sorting conjugates and Suffixes of Words in a Multiset (SB, SM, AR, GR, MS), p. 1161–?.
CIAACIAA-2014-DumitranGMM #bound
Bounded Prefix-Suffix Duplication (MD, JG, FM, VM), pp. 176–187.
ECIRECIR-2014-Moe #clustering
Improvements to Suffix Tree Clustering (REM), pp. 662–667.
DLTDLT-2013-BonomoMRRS #word
Suffixes, Conjugates and Lyndon Words (SB, SM, AR, GR, MS), pp. 131–142.
ICALPICALP-v1-2013-BilleFGKSV
Sparse Suffix Tree Construction in Small Space (PB, JF, ILG, TK, BS, HWV), pp. 148–159.
ICALPICALP-v2-2013-CzerwinskiMM #performance #regular expression #sequence
Efficient Separability of Regular Languages by Subsequences and Suffixes (WC, WM, TM), pp. 150–161.
LATALATA-2013-Blanchet-SadriL #problem #word
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem (FBS, JL), pp. 165–176.
PPoPPPPoPP-2013-DeoK #array #gpu #parallel
Parallel suffix array and least common prefix for the GPU (MD, SK), pp. 197–206.
CSMRCSMR-2012-Koschke #clone detection #detection #scalability #using
Large-Scale Inter-System Clone Detection Using Suffix Trees (RK), pp. 309–318.
CIAACIAA-2012-FaroL #algorithm #automaton #online #performance #string
A Fast Suffix Automata Based Algorithm for Exact Online String Matching (SF, TL), pp. 149–158.
ICDARICDAR-2011-WeiGB #word
A Method for Removing Inflectional Suffixes in Word Spotting of Mongolian Kanjur (HW, GG, YB), pp. 88–92.
VLDBVLDB-2012-MansourASK11 #named #parallel #performance #string
ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings (EM, AA, SS, PK), pp. 49–60.
SACSAC-2011-CostaLGR #representation
Representing a bilingual lexicon with suffix trees (JC, GPL, LG, LMSR), pp. 1164–1165.
DLTDLT-2010-PribavkinaR #complexity #regular expression
State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages (EVP, ER), pp. 376–386.
SIGMODSIGMOD-2009-GhotingM #parallel #performance
Serial and parallel methods for i/o efficient suffix tree construction (AG, KM), pp. 827–840.
CIKMCIKM-2009-BarskySTU #scalability #sequence
Suffix trees for very large genomic sequences (MB, US, AT, CU), pp. 1417–1420.
CIKMCIKM-2009-VriesKCC #array #robust #using
Robust record linkage blocking using suffix arrays (TdV, HK, SC, PC), pp. 305–314.
ICMLICML-2009-KarampatziakisK #learning #predict
Learning prediction suffix trees with Winnow (NK, DK), pp. 489–496.
SIGMODSIGMOD-2008-SinhaPMT #array #locality #pattern matching #performance
Improving suffix array locality for fast pattern matching on disk (RS, SJP, AM, AT), pp. 661–672.
CIKMCIKM-2008-BarskySTU #using
A new method for indexing genomes using on-disk suffix trees (MB, US, AT, CU), pp. 649–658.
ICDARICDAR-2007-JiangDR #recognition
A Suffix Tree Based Handwritten Chinese Address Recognition System (YJ, XD, ZR), pp. 292–296.
SIGMODSIGMOD-2007-PhoophakdeeZ
Genome-scale disk-based suffix tree indexing (BP, MJZ), pp. 833–844.
STOCSTOC-2007-FranceschiniM
Optimal suffix selection (GF, SM), pp. 328–337.
CIAACIAA-2007-CrochemoreEGM #automaton #on the
On the Suffix Automaton with Mismatches (MC, CE, AG, FM), pp. 144–156.
DLTDLT-2007-SciortinoZ #automaton #standard #word
Suffix Automata and Standard Sturmian Words (MS, LQZ), pp. 382–398.
ICALPICALP-2007-FranceschiniM #sorting
In-Place Suffix Sorting (GF, SM), pp. 533–545.
LATALATA-2007-AntoniouCIP #set #string
Application of suffix trees for the acquisition of common motifs with gaps in a set of strings (PA, MC, CSI, PP), pp. 57–66.
VLDBVLDB-2006-CandanHCTA #adaptation #clustering #named #xml
AFilter: Adaptable XML Filtering with Prefix-Caching and Suffix-Clustering (KSC, WPH, SC, JT, DA), pp. 559–570.
WCREWCRE-2006-KoschkeFF #clone detection #detection #syntax #using
Clone Detection Using Abstract Syntax Suffix Trees (RK, RF, PF), pp. 253–262.
ICALPICALP-v1-2006-ColeKL #performance
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing (RC, TK, ML), pp. 358–369.
ICMLICML-2006-HolmesJ
Looping suffix tree-based inference of partially observable hidden state (MPH, CLIJ), pp. 409–416.
ICMLICML-2006-TeoV #array #kernel #performance #string #using
Fast and space efficient string kernels using suffix arrays (CHT, SVNV), pp. 929–936.
CIAACIAA-2005-Rytter #fibonacci #graph #word
The Structure of Subword Graphs and Suffix Trees of Fibonacci Words (WR), pp. 250–261.
CIKMCIKM-2005-HalachevST #sequence #using
Exact match search in sequence data using suffix trees (MH, NS, AT), pp. 123–130.
VLDBVLDB-2004-TataHP
Practical Suffix Tree Construction (ST, RAH, JMP), pp. 36–47.
ICALPICALP-2003-KarkkainenS #array #linear
Simple Linear Work Suffix Array Construction (JK, PS), pp. 943–955.
CIAACIAA-2002-Balik #array
DAWG versus Suffix Array (MB), pp. 233–238.
ICMLICML-2002-Mladenic #learning #normalisation #using #word
Learning word normalization using word suffix and context from unlabeled data (DM), pp. 427–434.
STOCSTOC-2000-ColeH #performance
Faster suffix tree construction with missing suffix links (RC, RH), pp. 407–415.
STOCSTOC-2000-GrossiV #array #string
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (RG, JSV), pp. 397–406.
ICALPICALP-1999-KimP #2d #linear
Linear-Time Construction of Two-Dimensional Suffix Trees (DKK, KP), pp. 463–472.
STOCSTOC-1996-KosarajuD #assembly #scalability #string
Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction) (SRK, ALD), p. 659.
ICALPICALP-1996-FarachM #random
Optimal Logarithmic Time Randomized Suffix Tree Construction (MF, SM), pp. 550–561.
ESOPESOP-J-1994-GiegerichK95 #comparison #functional #imperative
A Comparison of Imperative and Purely Functional Suffix Tree Constructions (RG, SK), pp. 187–218.
STOCSTOC-1995-KosarajuD #assembly #scalability #string
Large-scale assembly of DNA strings and space-efficient construction of suffix trees (SRK, ALD), pp. 169–177.
DLTDLT-1995-Galvez #lr #parsing #stack
A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning (JFG), pp. 460–465.
ICALPICALP-1995-GiancarloG #algorithm #matrix #on the
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications (RG, RG), pp. 111–122.
ESOPESOP-1994-GiegerichK #functional #paradigm #programming
Suffix Trees in the Functional Programming Paradigm (RG, SK), pp. 225–240.
STOCSTOC-1994-Hariharan #parallel
Optimal parallel suffix tree construction (RH), pp. 290–299.
STOCSTOC-1994-Kosaraju #pattern matching #realtime
Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version) (SRK), pp. 310–316.
STOCSTOC-1994-SahinalpV #symmetry
Symmetry breaking for suffix tree construction (SCS, UV), pp. 300–309.
ICALPICALP-1987-LandauSV #parallel
Parallel Construction of a Suffix Tree (Extended Abstract) (GML, BS, UV), pp. 314–325.
SIGIRSIGIR-1987-Harman #analysis #online
A Failure Analysis on the Limitations of Suffixing in an Online Environment (DH), pp. 102–107.
SIGIRSIGIR-1982-FraenkelMP #question
Is Text Compression by Prefizes and Suffixes Practical? (ASF, MM, YP), pp. 289–311.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.