Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A sub-quadratic sequence alignment algorithm for unrestrictred cost matrices. In: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA). (2002) 679--688 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Transposition Invariant String Matching.. - Mäkinen, Navarro.. (Correct)
....We omit bounds that depend on the treshold k in the search problems. For d ID it is also easy to improve the bound below to O(mn) using min deques [12] in each row and column of the DP matrix. distance distance evaluation searching exact O(m) O(m n) dID ; dL O(mn= log m) O(mn= log m) [7] dD O(m n) greedy) O(mn= log m) 8] ID ; d L O( mn) O( mn) 22] Chapter 10, Sect. 4.2) D O(m n) greedy) O(mn) 9, 6] Table 2. Upper bounds for transposition invariant string matching. We have not added, for clarity, the size of the output in the (thresholded) search complexity, ....
M. Crochemore, G. Landau, and M. Ziv-Ukelson. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In Proc. SODA'2002, pp. 679688. ACM-SIAM, 2002.
Approximate Matching of Run-Length Compressed Strings - Mäkinen, Navarro, Ukkonen (2001) (Correct)
....we provide instead experimental evidence to support the conjecture. This paper is an extended version of a conference paper [21] The weighted edit distance computation was developed after the conference version. Motivated by our open question in that paper, Crochemore, Landau, and Ziv Ukelson [9] noticed that their sub quadratic sequence alignment algorithm for unrestricted cost matrices could be generalized to this problem; they obtained the same O(m m) bound using completely di erent techniques from ours. 2 Edit Distance on Run Length Compressed Strings 2.1 Edit Distance Let ....
M. Crochemore, G. M. Landau, and M. Ziv-Ukelson. A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices. In Proc. 13th Annual ACMSIAM Symposium on Discrete Algorithms (SODA'02), pages 679-688, 2002 (the citation is to the revised report 2001-08 at Institut Gaspard-Monge, Universite de Marne-la-Vallee). 34
Rapid Homology Search with Two-Stage Extension and Daughter Seeds - Ma (2005) (Correct)
No context found.
Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A sub-quadratic sequence alignment algorithm for unrestrictred cost matrices. In: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA). (2002) 679--688
Bioinformatics on a Heterogeneous Java Distributed System - Page, Keane, Naughton (2005) (Correct)
No context found.
M. Crochemore, G. Landau, and M. Ziv-Ukelson. A subquadratic sequence alignment algorithm for unrestricted scoring matrices. SIAM Journal of Computing, 32(6):1654-- 1673, 2003.
A High-Throughput Bioinformatics Distributed Computing.. - Keane, Page, McInerney, .. (2005) (Correct)
No context found.
Crochemore, M., Landau, G., and Ziv-Ukelson, M., "A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices", SIAM Journal of Computing, 2003, 32 (6), 1654-1673
Rapid Homology Search with Neighbor Seeds - Csürös, Ma (2005) (Correct)
No context found.
Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA). (2002) 679--688
Bit-Parallel Computation of Local Similarity Score Matrices.. - Hyyrö, Navarro (Correct)
No context found.
M. Crochemore, G. Landau, and M. Ziv-Ukelson. A sub-quadratic sequence alignment algorithm for unrestricted scoring matrices. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), pages 679--688, 2002.
Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2004) (Correct)
No context found.
M. Crochemore, G. Landau, and M. Ziv-Ukelson. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In Proc. 13th Symposium on Discrete Algorithms (SODA'02), pp. 679688. ACM-SIAM, 2002.
Algorithms for Transposition Invariant String Matching.. - Mäkinen, Navarro.. (Correct)
No context found.
M. Crochemore, G. Landau, and M. Ziv-Ukelson. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In Proc. SODA'2002, pp. 679688. ACM-SIAM, 2002.
Algorithms for Transposition Invariant String Matching.. - Mäkinen, Navarro.. (2003) (Correct)
No context found.
M. Crochemore, G. Landau, and M. Ziv-Ukelson. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In Proc. SODA'2002, pp. 679688. ACM-SIAM, 2002.
Algorithms for Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2002) (Correct)
No context found.
M. Crochemore, G. Landau, and M. Ziv-Ukelson. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In Proc. 13th Symposium on Discrete Algorithms (SODA'2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC