Last update: Fri Jan 5 02:08:04 MST 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Dorohonceanu:2000:AAP,
author = "Bogdan Dorohonceanu and Craig Nevill-Manning",
title = "Algorithm Alley: {A} Practical Suffix-Tree
Implementation for String Searches",
journal = j-DDJ,
volume = "25",
number = "7",
pages = "133--136, 140",
month = jul,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Nov 9 08:25:16 MST 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/dr-dobbs-2000.bib",
URL = "http://www.ddj.com/ftp/2000/2000_07/aa700.txt;
http://www.ddj.com/ftp/2000/2000_07/aa700.zip",
abstract = "Suffix trees are used for string searches. Our authors
describe how to build a generalized suffix tree data
structure using as few hardware resources as possible
while still approaching the time complexity derived in
theory. Additional resources include aa700.txt
(listings) and aa700.zip (source code).",
acknowledgement = ack-nhfb,
journal-URL = "http://www.ddj.com/",
}
Related entries
- 25-3-72,
25(3)113,
25(3)135,
25(5)111,
25(5)119,
25(6)119,
25(7)21,
25(7)119,
25(8)113,
25(9)109,
25(10)135
- 25-7-64,
25(8)133
- 25-7-70,
25(8)123,
25(11)149,
25(12)21,
26(5)141,
26(8)118,
26(10)81,
26(11)107,
27(10)36,
28(7)66
- algorithm, 25-1-10,
25(1)113,
25(2)123,
25(2)135,
25(3)123,
25(4)23,
25(4)111,
25(5)119,
25(6)131,
25(7)18,
25(8)133,
25(9)29,
25(9)133,
25(10)18,
25(10)147,
25(11)149,
25(12)18,
25(12)149,
26(1)18,
26(1)189,
26(2)18,
26(3)18,
26(3)137,
26(4)18,
26(4)21,
26(4)145,
26(5)141,
26(6)151,
26(7)132,
26(8)118,
26(9)121,
26(10)123,
26(11)21,
26(11)117,
26(12)115,
27(2)98,
27(3)97,
27(4)101,
27(5)21,
27(5)89,
27(6)94,
27(7)93,
27(8)z-8,
27(9)89,
27(10)36,
28(1)48,
28(5)66
- Alley,
25(1)113,
25(2)123,
25(3)123,
25(4)111,
25(5)119,
25(6)131,
25(8)133,
25(9)133,
25(10)147,
25(11)149,
25(12)149,
26(1)189,
26(3)137,
26(4)145,
26(5)141,
26(6)151,
26(7)132,
26(8)118,
26(9)121,
26(10)123,
26(11)117,
26(12)115
- author, 25-1-76,
25(2)115,
25(7)107
- build, 25-7-70,
25(7)119
- complexity, 25-4-66,
25(5)23,
26(4)z
- dastardly,
26(12)119,
25(6)131,
25(9)145,
25(10)159,
25(11)57,
26(1)18,
26(1)181
- describe, 25-1-76, 25-3-32,
25(7)21,
25(7)119,
25(10)147
- few,
25(8)21
- generalized,
28(3)42
- hardware,
25(7)21
- implementation,
25(4)101,
25(7)119,
25(8)133,
25(9)123,
25(12)109,
26(12)23
- possible,
25(2)123,
26(4)148,
26(12)75,
27(12)84
- practical, 25-2-78,
26(3)144,
27(10)86,
28(5)84,
28(7)75
- search,
25(4)111,
25(8)133,
25(8)145,
25(12)62,
25(12)141
- still, 25-6-46,
25(8)119,
25(12)129,
26(8)121,
26(10)73,
27(10)89
- string,
25(12)141,
26(4)145,
26(6)147
- structural,
25(3)23,
25(6)131,
25(10)159,
25(11)57,
25(11)149,
26(4)21,
26(4)145,
27(2)107,
28(5)37
- suffix,
25(7)143,
26(4)145
- theory,
26(11)99,
27(10)36,
27(10)86
- time, 25-2-12,
25(2)23,
25(3)128,
25(4)127
- tree,
25(8)133,
25(11)149,
25(12)149,
26(4)145
- while,
25(1)119,
25(12)129,
25(12)159,
26(1)197,
26(5)135,
26(10)91