Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files, Journal of Computer and System Sciences, vol.52, issue.2, pp.299-307, 1996. ,
DOI : 10.1006/jcss.1996.0023
String Editing and Longest Common Subsequences, Handbook of Formal Languages, pp.361-398, 1997. ,
DOI : 10.1007/978-3-662-07675-0_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6742
New clique and independent set algorithms for circle graphs, Discrete Applied Mathematics, vol.36, issue.1, pp.1-24, 1992. ,
DOI : 10.1016/0166-218X(92)90200-T
URL : http://doi.org/10.1016/0166-218x(93)90038-p
Efficient Parallel Algorithms for String Editing and Related Problems, SIAM Journal on Computing, vol.19, issue.5, pp.968-998, 1990. ,
DOI : 10.1137/0219066
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.9057
Matching for Run-Length Encoded Strings, Journal of Complexity, vol.15, issue.1, pp.4-16, 1999. ,
DOI : 10.1006/jcom.1998.0493
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.2269
Edit distance of run-length encoded strings, Information Processing Letters, vol.83, issue.6, pp.307-314, 2002. ,
DOI : 10.1016/S0020-0190(02)00215-6
Notes on searching in multidimensional monotone arrays, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.497-512, 1988. ,
DOI : 10.1109/SFCS.1988.21966
Text Compression, 1990. ,
A space efficient algorithm for finding the best nonoverlapping alignment score, Theoretical Computer Science, vol.145, issue.1-2, pp.357-369, 1995. ,
DOI : 10.1016/0304-3975(95)92848-R
An improved algorithm for computing the edit distance of run-length coded strings, Information Processing Letters, vol.54, issue.2, pp.93-96, 1995. ,
DOI : 10.1016/0020-0190(95)00005-W
Recent Developments in Linear-Space Alignment Methods: A Survey, Journal of Computational Biology, vol.1, issue.4, pp.271-291, 1994. ,
DOI : 10.1089/cmb.1994.1.271
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices, SIAM Journal on Computing, vol.32, issue.6, pp.1654-1673, 2003. ,
DOI : 10.1137/S0097539702402007
URL : https://hal.archives-ouvertes.fr/hal-00619573
Transducers and repetitions, Theoretical Computer Science, vol.45, pp.63-86, 1986. ,
DOI : 10.1016/0304-3975(86)90041-1
URL : https://hal.archives-ouvertes.fr/hal-00619540
Text Algorithms, 1994. ,
URL : https://hal.archives-ouvertes.fr/hal-00619796
Sequence comparison with mixed convex and concave costs, Journal of Algorithms, vol.11, issue.1, pp.85-101, 1990. ,
DOI : 10.1016/0196-6774(90)90031-9
URL : http://academiccommons.columbia.edu/download/fedora_content/download/ac:142800/CONTENT/cucs-382-88.pdf
Universal codeword sets and representations of the integers, IEEE Transactions on Information Theory, vol.21, issue.2, pp.194-203, 1975. ,
DOI : 10.1109/TIT.1975.1055349
Speeding up dynamic programming, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.488-296, 1988. ,
DOI : 10.1109/SFCS.1988.21965
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.7067
Sparse dynamic programming I: linear cost functions, Journal of the ACM, vol.39, issue.3, pp.546-567, 1992. ,
DOI : 10.1145/146637.146650
String Matching in Lempel???Ziv Compressed Strings, Algorithmica, vol.20, issue.4, pp.388-404, 1998. ,
DOI : 10.1007/PL00009202
Dynamic Programming: Special Cases, Pattern Matching Algorithms, pp.201-232, 1997. ,
A linear-time algorithm for a special case of disjoint set union, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.209-221, 1985. ,
DOI : 10.1145/800061.808753
Speeding up dynamic programming with applications to molecular biology, Theoretical Computer Science, vol.64, issue.1, pp.107-118, 1989. ,
DOI : 10.1016/0304-3975(89)90101-1
A linear-time algorithm for concave one-dimensional dynamic programming, Information Processing Letters, vol.33, issue.6, pp.309-311, 1990. ,
DOI : 10.1016/0020-0190(90)90215-J
Randomised efficient algorithms for compressed strings: the finger-print approach, Proc. 7th Annual Symposium On Combinatorial Pattern Matching, pp.39-49, 1996. ,
Almost-optimal fully LZW-compressed pattern matching, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096), 1999. ,
DOI : 10.1109/DCC.1999.755681
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.6311
Algorithms on Strings, Trees, and Sequences, 1997. ,
DOI : 10.1017/CBO9780511574931
A linear space algorithm for computing maximal common subsequences, Communications of the ACM, vol.18, issue.6, pp.341-343, 1975. ,
DOI : 10.1145/360825.360861
Algorithms for the Longest Common Subsequence Problem, Journal of the ACM, vol.24, issue.4, pp.664-675, 1977. ,
DOI : 10.1145/322033.322044
The Least Weight Subsequence Problem, SIAM Journal on Computing, vol.16, issue.4, pp.628-638, 1987. ,
DOI : 10.1137/0216043
A time-efficient, linear-space local similarity algorithm, Advances in Applied Mathematics, vol.12, issue.3, pp.337-357, 1991. ,
DOI : 10.1016/0196-8858(91)90017-D
URL : http://doi.org/10.1016/0196-8858(91)90017-d
An algorithm for locating non-overlapping regions of maximum alignment score, SIAM J. Comput, vol.25, issue.3, pp.648-662, 1996. ,
DOI : 10.1007/BFb0029798
Approximate String Matching over Ziv???Lempel Compressed Text, Proc. 11th Annual Symposium On Combinatorial Pattern Matching, pp.195-209, 2000. ,
DOI : 10.1007/3-540-45123-4_18
Lempel-Ziv parsing and sublinear-size index structures for string matching, Proc. Third South American Workshop on String Processing (WSP '96), pp.141-155, 1996. ,
Shift-And Approach to Pattern Matching in LZW Compressed Text, Proc. 10th Annual Symposium On Combinatorial Pattern Matching, pp.1-13, 1999. ,
DOI : 10.1007/3-540-48452-3_1
An Almost Linear Time Algorithm for Generalized Matrix Searching, SIAM Journal on Discrete Mathematics, vol.3, issue.1, pp.81-97, 1990. ,
DOI : 10.1137/0403009
Incremental String Comparison, SIAM Journal on Computing, vol.27, issue.2, pp.557-582, 1998. ,
DOI : 10.1137/S0097539794264810
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.1766
Ziv-Ukelson, Two Algorithms for LCS Consecutive Suffix Alignment, Proc. 15th Annual Symposium On Combinatorial Pattern Matching, pp.173-193, 2004. ,
On the Common Substring Alignment Problem, Journal of Algorithms, vol.41, issue.2, pp.338-359, 2001. ,
DOI : 10.1006/jagm.2001.1191
Sparse LCS Common Substring Alignment, Sparse LCS Common Substring Alignment, pp.259-270, 2003. ,
DOI : 10.1016/j.ipl.2003.09.006
On the Complexity of Finite Sequences, IEEE Transactions on Information Theory, vol.22, issue.1, pp.75-81, 1976. ,
DOI : 10.1109/TIT.1976.1055501
Binary Codes Capable of Correcting Deletions, Insertions and Reversals, Soviet Phys, Dokl, vol.10, pp.707-710, 1966. ,
A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977. ,
DOI : 10.1109/TIT.1977.1055714
Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory, vol.24, issue.5, pp.530-536, 1978. ,
DOI : 10.1109/TIT.1978.1055934
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.2892
A Geometric Shortest Path Problem, with Application to Computing a Longest Common Subsequence in Run-Length Encoded Strings, Dept. of Applied Mathematics, 1997. ,
An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms, vol.5, issue.3, pp.422-432, 1984. ,
DOI : 10.1016/0196-6774(84)90021-X
Arikawa: Faster Approximate String Matching Over Compressed Text, Proc. Data Compression Conference (DCC2001), pp.459-468, 2001. ,
DOI : 10.1109/dcc.2001.917177
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.2959
Approximate Matching of Run-Length Compressed Strings, Proc. 12th Annual Symposium On Combinatorial Pattern Matching, pp.1-13, 1999. ,
Approximate Matching of Run-Length Compressed Strings, Algorithmica, pp.347-369, 2003. ,
A text compression scheme that allows fast searching directly in the compressed file, Proc. 5th Annual Symposium On Combinatorial Pattern Matching, pp.31-49, 2001. ,
A faster algorithm computing string edit distances, Journal of Computer and System Sciences, vol.20, issue.1, pp.18-31, 1980. ,
DOI : 10.1016/0022-0000(80)90002-1
URL : http://doi.org/10.1016/0022-0000(80)90002-1
Sequence comparison with concave weighting functions, Bulletin of Mathematical Biology, vol.44, issue.2, pp.97-120, 1988. ,
DOI : 10.1007/BF02459948
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text, Proc. 10th Annual Symposium On Combinatorial Pattern Matching, pp.14-36, 1999. ,
DOI : 10.1007/3-540-48452-3_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.2377
Boyer???Moore String Matching over Ziv-Lempel Compressed Text, Proc. 11th Annual Symposium On Combinatorial Pattern Matching, pp.166-180, 2000. ,
DOI : 10.1007/3-540-45123-4_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.1232
A general method applicable to the search for similarities in the amino acid sequence of two proteins, Journal of Molecular Biology, vol.48, issue.3, pp.443-453, 1970. ,
DOI : 10.1016/0022-2836(70)90057-4
Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison, 1983. ,
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings, SIAM Journal on Computing, vol.27, issue.4, pp.972-992, 1998. ,
DOI : 10.1137/S0097539795288489
Speeding Up Pattern Matching by Text Compression, LNCS, vol.1767, pp.306-315, 2000. ,
DOI : 10.1007/3-540-46521-9_25
Identification of common molecular subsequences, Journal of Molecular Biology, vol.147, issue.1, pp.195-197, 1981. ,
DOI : 10.1016/0022-2836(81)90087-5
Finding approximate patterns in strings, Journal of Algorithms, vol.6, issue.1, pp.132-137, 1985. ,
DOI : 10.1016/0196-6774(85)90023-9
A Technique for High-Performance Data Compression, Computer, vol.17, issue.6, pp.8-19, 1984. ,
DOI : 10.1109/MC.1984.1659158