1 |
P. van Emde Boas, R. Kass, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory, 10, 99-127, 1977
DOI
|
2 |
D.B. Johnson, A priority queue in which initialization and queue operations take O(loglogD) time, Math. Systems Theory, 15, 295-309, 1982
DOI
|
3 |
P. Green, http://www.phrap.org
|
4 |
National Center for Biotechnology Information, http://www.ncbi.nlm.nih.gov
|
5 |
N. Efraty and G. M. Landau, Sparse normalized local alignment, In Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM), 333-346, 2004
|
6 |
D. Eppstein, Z. Galil, R. Giancarlo, and G. F. Italiano, Sparse dynamic programming I: linear cost functions, Journal of ACM, 39(3), 519-545, 1992
DOI
|
7 |
D. Gusfield, Algorithms on strings, trees, and sequences, Cambridge University Press, 1997
|
8 |
A.N. Arslan, O. Egecioglu, and P.A. Pevzner, A new approach to sequence comparison: normalized sequence alignment, Bioinformatics, 17(4), 327-337, 2001
DOI
ScienceOn
|