J. S. Sim, K. Park, C. S. Iliopoulos, and W. F. Smyth. Approximate Periods of Strings. In Proc. 10th Combinatorial Pattern Matching Conference, LNCS 1645, Springler-Verlag, pages 123--133, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Algorithm for Approximate Tandem Repeats - Landau, Schmidt, Sokol (1993) (29 citations) (Correct)
....approximate multiple repeat (or multirepeat for short) is a multiple repeat in which the periods of the repeat are approximate. The difficulties of defining approximate multiple repeats are addressed in Section 3, where we present a simple and precise definition. A similar notion is discussed in [SPIS99] where approximate periodicity of strings is defined as follows. Given two strings x and p, p is a t approximate period of x if there exists a partition of x into disjoint blocks of substrings p 1 : p r such that the distance between p and every p i (1 i r) is less than or equal to t. The ....
....of strings is defined as follows. Given two strings x and p, p is a t approximate period of x if there exists a partition of x into disjoint blocks of substrings p 1 : p r such that the distance between p and every p i (1 i r) is less than or equal to t. The algorithm presented in [SPIS99] finds the substring p of the input string x that is the period of x with the minimum distance. When the Hamming distance is used, the complexity of the algorithm is O(n 3 ) and with the (weighted) edit distance it is O(n 4 ) Our definition of approximate periodicity is simpler, yielding a ....
[Article contains additional citation context not shown here]
J. S. Sim, K. Park, C. S. Iliopoulos, W. F. Smyth. Approximate Periods of Strings. In Proc. Tenth Combinatorial Pattern Matching Conference, Lecture Notes in Computer Science 1645, pages 123-- 133. Springer-Verlag, 1999.
Repetitive Perhaps, But Certainly Not Boring - Smyth Self-citation (Smyth) (Correct)
....algorithms for nding approximate tandem repetitions under Hamming and Levenshtein distance were described, while in [S98] distance in a grid graph is used as the basis of algorithms to nd approximate tandem and split repetitions. Very recently, the idea of an approximate generator was introduced [SIKS99]: u is said to be a k approximate generator of x if x = u 1 u 2 u r for some integer r 1, where for every j 2 1: r, the distance d(u; u j ) k. Using this de nition, algorithms to solve the following two problems under various distance measures were proposed [SIKS99] Given strings x ....
....was introduced [SIKS99] u is said to be a k approximate generator of x if x = u 1 u 2 u r for some integer r 1, where for every j 2 1: r, the distance d(u; u j ) k. Using this de nition, algorithms to solve the following two problems under various distance measures were proposed [SIKS99]: Given strings x and u, nd the least integer k such that u is a k approximate generator of x. Given a string x, nd a substring u of x that is a k approximate generator of x with minimum distance k. There has apparently been no work done that deals speci cally with approximate covers or ....
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park & W. F. Smyth, Approximate periods of strings, preprint.
Parallel Pattern Identification in Biological Sequences on.. - Huang, Rajasekaran (Correct)
No context found.
J. S. Sim, K. Park, C. S. Iliopoulos, and W. F. Smyth. Approximate Periods of Strings. In Proc. 10th Combinatorial Pattern Matching Conference, LNCS 1645, Springler-Verlag, pages 123--133, 1999.
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