1 |
A. Apostolico and F.P. Preparata, Optimal off-line detection of repetitions in a string, Theoretical Computer Science 22 (1983), 297-315
DOI
ScienceOn
|
2 |
W. Bains and G. Smith, A novel method for nucleic acid sequence determination, Journal of Theoretical Biology 135, 3 (1988), 303-307
DOI
ScienceOn
|
3 |
S. Fodor, J. Read, M. Pirrung, L. Stryer, A. Lu, and D. Solas, Light-directed, spatially addressable parallel chemical synthesis, Science 251 (1991), 767-773
DOI
|
4 |
T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory 31, 4 (1985), 469-472
DOI
|
5 |
C.S. Park, M.-K. Lee and D.K. Kim, New computation paradigm for modular exponentiation using a graph model, in: Stochastic Algorithms: Foundations and Applications (SAGA 2005), LNCS 3777 (2005), 170-179
DOI
ScienceOn
|
6 |
D. Moore and W.F. Smyth, A correction to "An optimal algorithm to compute all the cover of a string," Information Processing Letters 54, 2 (1995), 101-103
DOI
ScienceOn
|
7 |
D.E. Knuth, J.H. Morris, and V.R. Pratt, Fast pattern matching in strings, SIAM Journal on Computing 6, 1 (1977), 323-350
DOI
|
8 |
R. L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21 ,2 (1978), 120-126
DOI
ScienceOn
|
9 |
Y. Yacobi, Fast exponentiation using data compresseio, SIAM Journal on Computing 28, 2 (1998), 700-703
DOI
ScienceOn
|
10 |
S.S. Skiena and G. Sundaram, Reconstructing Strings from Substrings, Journal of Computational Biology 2 (1995), 333-353
DOI
ScienceOn
|
11 |
M. Crochemore, An optimal algorithm for computing the repetitions in a word, Information Processing Letters 12, 5 (1981), 244-250
DOI
ScienceOn
|
12 |
C.S. Iliopoulos, D.W.G. Moore and K. Park, Covering a string, Algorithmica 16 (1996), 288-297
DOI
|
13 |
C.S. Iliopoulos and W.F. Smyth, On-line algorithms for -covering, in: Proc. 9th Australasian Workshop on Combinatorial Algorithms (1998), 97-106
|
14 |
Y. Li and W.F. Smyth, An optimal on-line algorithm to compute all the covers of a string, preprint
|
15 |
D. E. Knuth, The art of computer programming: Seminumerical algorithms, Volumn 2, 2nd edition, Addison-Wesley, Reading, MA (1981) 461-485
|
16 |
A. Apostolico, M. Farach, and C.S. Iliopoulos, Optimal superprimitivity testing for strings, Information Processing Letters 39, 1 (1991), 17-20
DOI
ScienceOn
|
17 |
P.A. Pevzner and R.J. Lipshutz, Towards DNA sequencing by hybridization, in: 19th Symp. on Mathem. Found. of Comp. Sci., LNCS 841 (1994), 143-258
|
18 |
E.M. McCreight, A space-economical suffix tree construction algorithm, Journal of ACM 23 (1976), 262-272
DOI
ScienceOn
|
19 |
National Institute of Standards and Technology, Digital Signature Standard, FIPS Publication 186 (1994)
|
20 |
D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge Univ. Press 1997
|
21 |
M.G. Main and R.J. Lorentz, An algorithm for finding all repetitions in a string, Journal of Algorithms 5 (1984), 422-432
DOI
|
22 |
P. Weiner, Linear pattern matching algorithms, Proc. 14th IEEE Symp. Switching and Automata Theory (1973), 1-11
|
23 |
E. Ukkonen, On-Line Construction of Suffix Trees, Algorithmica 14, 3 (1995), 249-260
DOI
ScienceOn
|
24 |
D.M. Gordon, A Survey of Fast Exponentiation Methods, Journal of Algorithms 27, 1 (1998), 129- 146
DOI
ScienceOn
|
25 |
C. K. Koc, Analysis of sliding window techniques for exponentiation, Computers and Mathematics with Application 30, 10 (1995) 17-24
|