M.G. Main and R.J. Lorentz, "An O(nlogn) algorithm for finding all repetitions in a string," J. of Algorithms, Vol 5, 422-432, 1984 84 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Fault-Tolerant Repeat Pattern Mining On Biological Data - Liao (2001) (Correct)
....In section 2.2, we present some algorithms on finding approximate matching patterns. 2.1 Exact repeat patterns mining There exists some research work that has been done on how to find the perfect tandem repeat patterns. The motivation for it can be found in the survey [ML 85] Main and Lorentz [ML 84] present an O(nlogn) algorithm which shows all perfect tandem repeats. Later, Apostolico [Ap 92] describes an optimal speed up parallel algorithm for the problem. As mentioned in section 1.2, exact repeating patterns are less common in the DNA sequence compared to approximately repeating patterns. ....
M.G. Main and R.J. Lorentz, "An O(nlogn) algorithm for finding all repetitions in a string," J. of Algorithms, Vol 5, 422-432, 1984 84
An Algorithm For Locating Non-Overlapping Regions Of Maximum.. - Kannan, Myers (1993) (11 citations) (Correct)
....has been dealt with before and turns out to be of significantly lower complexity than the problem of finding the best scoring twins. When the exactly repeating regions are required to be adjacent or tandem, i.e. when the goal is to find the longest substring of A of the form ww, Main and Lorentz[7] provide an O(N log N) algorithm. If gaps are allowed between exactly repeating substrings, the problem becomes even simpler and can be handled in O(N) time, by first creating a suffix tree and then computing the largest and smallest indices (of suffixes) which go through each internal node in ....
M.G. Main and R.J. Lorentz, "An O(n log n) algorithm for finding all repetitions in a string," J. of Algorithms 5 (1984), 422--432.
Two Dimensional Matching - Amir, Farach (1997) (Correct)
No context found.
M.G. Main and R.J. Lorentz [1984]. "An O(n log n) algorithm for finding all repetitions in a string", Journal of Algorithms, 422--432.
Efficient Parallel And Serial Approximate String Matching - Gad M. Landau, Uzi Vishkin (1986) (Correct)
No context found.
M.G. Main and R.J. Lorentz, "An O(n log n) algorithm for finding all repetitions in a string", J. of Algorithms (1984), pp. 422-432.
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