-
1
-
-
0030129729
-
Let sleeping files lie: Pattern matching in Z-compressed files
-
[ABF96]
-
[ABF96] A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Computer and System Sciences, 52(2):299-307, 1996.
-
(1996)
Journal of Computer and System Sciences
, vol.52
, Issue.2
, pp. 299-307
-
-
Amir, A.1
Benson, G.2
Farach, M.3
-
2
-
-
0034497386
-
New data structures for orthogonal range searching
-
[ABR00]. Danielle C. Young, editor
-
[ABR00] S. Alstrup, G. S. Brodai, and T. Rauhe. New data structures for orthogonal range searching. In Danielle C. Young, editor, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 198-207, 2000.
-
(2000)
Proceedings of the 41st Annual Symposium on Foundations of Computer Science
, pp. 198-207
-
-
Alstrup, S.1
Brodai, G.S.2
Rauhe, T.3
-
3
-
-
85015487998
-
Efficient randomized dictionary matching algorithms
-
[AFM92]k, number 664 in Lecture Notes in Computer Science
-
[AFM92] A. Amir, M. Farach, and Y. Matias. Efficient randomized dictionary matching algorithms. In Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, number 664 in Lecture Notes in Computer Science, pages 262-275, 1992.
-
(1992)
Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching
, pp. 262-275
-
-
Amir, A.1
Farach, M.2
Matias, Y.3
-
4
-
-
0000795886
-
Range searching
-
[Aga97]. J. E. Goodman and J. O'Rourke, editors, CRC Press
-
[Aga97] P. Agarwal. Range searching. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry. CRC Press, 1997.
-
(1997)
Handbook of Discrete and Computational Geometry
-
-
Agarwal, P.1
-
7
-
-
0003573193
-
A block-sorting lossless data compression algorithm
-
[BW94], Hewlett Packard Laboratories
-
[BW94] M. Burrows and D. J. Wheeler. A block-sorting lossless data compression algorithm. Technical Report SRC-RR-124, Hewlett Packard Laboratories, 1994.
-
(1994)
Technical Report
, vol.SRC-RR-124
-
-
Burrows, M.1
Wheeler, D.J.2
-
9
-
-
0036947893
-
DNA-compress: Fast and effective DNA sequence compression
-
[CLMT02]
-
[CLMT02] X. Chen, M. Li, B. Ma, and J. Tromp. DNA-Compress: Fast and effective DNA sequence compression. Bioinformatics, 18(12):1696-1698, 2002.
-
(2002)
Bioinformatics
, vol.18
, Issue.12
, pp. 1696-1698
-
-
Chen, X.1
Li, M.2
Ma, B.3
Tromp, J.4
-
11
-
-
0002854989
-
Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms
-
[CV86]
-
[CV86] R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In Proceedings of the 18th Symposium on Theory of Computing, pages 206-219, 1986.
-
(1986)
Proceedings of the 18th Symposium on Theory of Computing
, pp. 206-219
-
-
Cole, R.1
Vishkin, U.2
-
15
-
-
0000100455
-
A new challenge for compression algorithms: Genetic sequences
-
[GT94]
-
[GT94] S. Grumbach and F. Tahi. A new challenge for compression algorithms: genetic sequences. Information Processing and Management, 30(6):875-886, 1994.
-
(1994)
Information Processing and Management
, vol.30
, Issue.6
, pp. 875-886
-
-
Grumbach, S.1
Tahi, F.2
-
17
-
-
0033690274
-
Compressed suffix arrays and suffix trees with applications to text indexing and string matching
-
[GV00]
-
[GV00] R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings ACM Symposium on the Theory of Computing, pages 397-406, 2000.
-
(2000)
Proceedings ACM Symposium on the Theory of Computing
, pp. 397-406
-
-
Grossi, R.1
Vitter, J.S.2
-
19
-
-
84976712224
-
Rapid identification of repeated patterns in strings, trees and arrays
-
[KMR72]
-
[KMR72] R. M. Karp, R. E. Miller, and A. L. Rosenberg. Rapid identification of repeated patterns in strings, trees and arrays. In Proceedings of the 4th Symposium on Theory of Computing, pages 125-136, 1972.
-
(1972)
Proceedings of the 4th Symposium on Theory of Computing
, pp. 125-136
-
-
Karp, R.M.1
Miller, R.E.2
Rosenberg, A.L.3
-
20
-
-
0022030599
-
Efficient randomized pattern-matching algorithms
-
[KR87]
-
[KR87] R. M. Karp and M. O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249-260, 1987.
-
(1987)
IBM Journal of Research and Development
, vol.31
, Issue.2
, pp. 249-260
-
-
Karp, R.M.1
Rabin, M.O.2
-
21
-
-
0038415957
-
The similarity metric
-
+03]
-
+03] M. Li, X. Chen, X. Li, B. Ma, and P. Vitanyi. The similarity metric. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 863-872, 2003.
-
(2003)
Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 863-872
-
-
Li, M.1
Chen, X.2
Li, X.3
Ma, B.4
Vitanyi, P.5
-
23
-
-
84992701401
-
Can general-purpose compression schemes really compress DNA sequences?
-
[MSIO00]
-
[MSIO00] T. Matsumoto, K. Sadakane, H. Imai, and T. Okazaki. Can general-purpose compression schemes really compress DNA sequences? In Currents in Computational Molecular Biology, pages 76-77, 2000.
-
(2000)
Currents in Computational Molecular Biology
, pp. 76-77
-
-
Matsumoto, T.1
Sadakane, K.2
Imai, H.3
Okazaki, T.4
-
24
-
-
21144458670
-
String matching with preprocessing of text and pattern
-
[Nao91]. Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP)
-
[Nao91] M. Naor. String matching with preprocessing of text and pattern. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP), volume 510 of Lecture Notes in Computer Science, pages 739-750, 1991.
-
(1991)
Lecture Notes in Computer Science
, vol.510
, pp. 739-750
-
-
Naor, M.1
-
26
-
-
0030935318
-
Detection of significant patterns by compression algorithms: The case of approximate tandem repeats in DNA sequences
-
+97]
-
+97] E. Rivals, O. Delgrange, J.-P. Delahaye, M. Dauchet, M.-O. Delorme, A. Henaut, and E. Ollivier. Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. Comp. Appl. BioSci, 13(2):131-136, 1997.
-
(1997)
Comp. Appl. BioSci
, vol.13
, Issue.2
, pp. 131-136
-
-
Rivals, E.1
Delgrange, O.2
Delahaye, J.-P.3
Dauchet, M.4
Delorme, M.-O.5
Henaut, A.6
Ollivier, E.7
-
28
-
-
0007475289
-
Fast discerning repeats in DNA sequences with a compression algorithm
-
[RDDD97]
-
[RDDD97] E. Rivals, M. Dauchet, J. Delahaye, and O. Delgrange. Fast discerning repeats in DNA sequences with a compression algorithm. In Proc. Genome Informatics Workshop, pages 215-226, 1997.
-
(1997)
Proc. Genome Informatics Workshop
, pp. 215-226
-
-
Rivals, E.1
Dauchet, M.2
Delahaye, J.3
Delgrange, O.4
-
29
-
-
0347494019
-
Linear algorithm for data compression via string matching
-
[RPE81]
-
[RPE81] M. Rodeh, V. R. Pratt, and S. Even. Linear algorithm for data compression via string matching. Journal of the ACM, 28(1):16-24, 1981.
-
(1981)
Journal of the ACM
, vol.28
, Issue.1
, pp. 16-24
-
-
Rodeh, M.1
Pratt, V.R.2
Even, S.3
-
31
-
-
0020190931
-
Data compression via textural substitution
-
[SS82]
-
[SS82] J. A. Storer and T. G. Szymanski. Data compression via textural substitution. Journal of the ACM, 29(4), 1982.
-
(1982)
Journal of the ACM
, vol.29
, Issue.4
-
-
Storer, J.A.1
Szymanski, T.G.2
-
32
-
-
0142249968
-
Large edit distance with multiple block operations
-
[SS03]. 10th International Symposium on String Processing and Information Retrieval (SPIRE)
-
[SS03] D. Shapira and J. Storer. Large edit distance with multiple block operations. In 10th International Symposium on String Processing and Information Retrieval (SPIRE), volume 2857 of Lecture Notes in Computer Science, 2003.
-
(2003)
Lecture Notes in Computer Science
, vol.2857
-
-
Shapira, D.1
Storer, J.2
-
33
-
-
20744454083
-
Data compression using locally consistent parsing
-
[SV95], University of Maryland Department of Computer Science
-
[SV95] S. C. Sahinalp and U. Vishkin. Data compression using locally consistent parsing. Technical report, University of Maryland Department of Computer Science, 1995.
-
(1995)
Technical Report
-
-
Sahinalp, S.C.1
Vishkin, U.2
-
35
-
-
20744444195
-
DNA data compression in the post genome era
-
[SYKT01]
-
[SYKT01] H. Sato, T. Yoshioka, A. Konagaya, and T. Toyoda. DNA data compression in the post genome era. In Proceedings of Genome Informatics 12, pages 512-514, 2001.
-
(2001)
Proceedings of Genome Informatics
, vol.12
, pp. 512-514
-
-
Sato, H.1
Yoshioka, T.2
Konagaya, A.3
Toyoda, T.4
-
37
-
-
0017493286
-
A universal algorithm for sequential data compression
-
[ZL77]
-
[ZL77] J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT-23:337-343, 1977.
-
(1977)
IEEE Transactions on Information Theory
, vol.IT-23
, pp. 337-343
-
-
Ziv, J.1
Lempel, A.2
|