-
2
-
-
0027634755
-
Improved behaviour of tries by adaptive branching
-
A. Andersson, and S. Nilsson Improved behaviour of tries by adaptive branching Inform. Process. Lett. 46 1993 293 300
-
(1993)
Inform. Process. Lett.
, vol.46
, pp. 293-300
-
-
Andersson, A.1
Nilsson, S.2
-
3
-
-
0002139526
-
The myriad virtues of subword trees
-
A. Apostolico Z. Galil, Combinatorial Algorithms on Words Springer-Verlag
-
A. Apostolico The myriad virtues of subword trees A. Apostolico Z. Galil Combinatorial Algorithms on Words NATO ASI Series vol. F12 1985 Springer-Verlag 85 96
-
(1985)
NATO ASI Series
, vol.12
, pp. 85-96
-
-
Apostolico, A.1
-
4
-
-
35248890396
-
Fast lightweight suffix array construction and checking
-
R.A. Baeza-Yates E. Chávez M. Crochemore, Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
-
S. Burkhardt, and J. Kärkkäinen Fast lightweight suffix array construction and checking R.A. Baeza-Yates E. Chávez M. Crochemore Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 2676 2003 55 69
-
(2003)
Lecture Notes in Computer Science
, vol.2676
, pp. 55-69
-
-
Burkhardt, S.1
Kärkkäinen, J.2
-
5
-
-
0028516811
-
Sublinear expected time approximate string matching and biological applications
-
W.I. Chang, and E.L. Lawler Sublinear expected time approximate string matching and biological applications Algorithmica 12 1994 327 344
-
(1994)
Algorithmica
, vol.12
, pp. 327-344
-
-
Chang, W.I.1
Lawler, E.L.2
-
7
-
-
0033153375
-
Alignment of whole genomes
-
A. Delcher, S. Kasif, R. Fleischmann, J. Peterson, O. White, and S. Salzberg Alignment of whole genomes Nucleic Acids Research 27 11 1999 2369 2376
-
(1999)
Nucleic Acids Research
, vol.27
, Issue.11
, pp. 2369-2376
-
-
Delcher, A.1
Kasif, S.2
Fleischmann, R.3
Peterson, J.4
White, O.5
Salzberg, S.6
-
11
-
-
0000950910
-
The string B-Tree: A new data structure for string search in external memory and its applications
-
P. Ferragina, and R. Grossi The string B-Tree: a new data structure for string search in external memory and its applications J. ACM 46 2 1999 238 280
-
(1999)
J. ACM
, vol.46
, Issue.2
, pp. 238-280
-
-
Ferragina, P.1
Grossi, R.2
-
12
-
-
0001553729
-
From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
-
R. Giegerich, and S. Kurtz From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction Algorithmica 1997
-
(1997)
Algorithmica
-
-
Giegerich, R.1
Kurtz, S.2
-
14
-
-
0026836177
-
An efficient algorithm for the all pairs suffix-prefix problem
-
D. Gusfield, G.M. Landau, and D. Schieber An efficient algorithm for the all pairs suffix-prefix problem Inform. Process. Lett. 41 1992 181 185
-
(1992)
Inform. Process. Lett.
, vol.41
, pp. 181-185
-
-
Gusfield, D.1
Landau, G.M.2
Schieber, D.3
-
16
-
-
84957881825
-
Suffix cactus: A cross between suffix tree and suffix array
-
Z. Galil E. Ukkonen, Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching Springer-Verlag
-
J. Kärkkäinen Suffix cactus: a cross between suffix tree and suffix array Z. Galil E. Ukkonen Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching Lecture Notes in Comput. Sci. vol. 937 1995 Springer-Verlag 191 204
-
(1995)
Lecture Notes in Comput. Sci.
, vol.937
, pp. 191-204
-
-
Kärkkäinen, J.1
-
18
-
-
0011996455
-
Reducing the space requirement of suffix trees
-
Report 98-03 Technische Fakultat, Universitat Bielefeld
-
S. Kurtz, Reducing the space requirement of suffix trees, Report 98-03, Technical Report, Technische Fakultat, Universitat Bielefeld, 1998
-
(1998)
Technical Report
-
-
Kurtz, S.1
-
19
-
-
0033066718
-
Reputer: Fast computation of maximal repeats in complete genomes
-
S. Kurtz, and C. Schleiermacher Reputer: Fast computation of maximal repeats in complete genomes Bioinformatics 15 5 1999 426 427
-
(1999)
Bioinformatics
, vol.15
, Issue.5
, pp. 426-427
-
-
Kurtz, S.1
Schleiermacher, C.2
-
21
-
-
0016942292
-
A space-economical suffix tree construction algorithm
-
E.M. McCreight A space-economical suffix tree construction algorithm J. ACM 23 1976 262 272
-
(1976)
J. ACM
, vol.23
, pp. 262-272
-
-
McCreight, E.M.1
-
22
-
-
0001704377
-
On-line construction of suffix-trees
-
E. Ukkonen On-line construction of suffix-trees Algorithmica 14 1995 249 260
-
(1995)
Algorithmica
, vol.14
, pp. 249-260
-
-
Ukkonen, E.1
|