Alberto Apostolico, Martin Farach, Costas S. Iliopoulos  Home/Search
Context Related
| rutgers.edu/~farach/pub...SuperPrim.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/~farach/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A string w covers another string z if every position of z is within some occurrence of in z. (Update)
Context of citations to this paper: More
...result of Thue not all strings are quasiperiodic. A string that is not quasiperiodic is superprimitive. Apostolico, Farach and Iliopoulos [5] presented an algorithm that nds the quasiperiod of a given string of length n in time O(n) This algorithm was simpli ed and made on...
...gave an O(n log 2 n) time algorithm to find all maximal quasiperiodic substrings within a given string. Apostolico, Farach and Iliopoulos [19] gave an O(n) time algorithm that finds the quasiperiod of a given string, namely the shortest string that covers the string in...
Cited by: More
String Superprimitivity Test on the Reconfigurable Bus Model - Chang, Yang, Huang (Correct)
Algorithms in Computational Biology - Pedersen (2000) (Correct)
Approximate Periods of Strings - Sim, Iliopoulos, Park, Smyth (Correct)
Active bibliography (related documents): More All
0.1: Finding Maximal Quasiperiodicities in Strings - Brodal, Pedersen (1999) (Correct)
0.1: Main Researchers Involved in the Project - From French Side (Correct)
0.1: Repetitive Perhaps, But Certainly Not Boring - Smyth (Correct)
Similar documents based on text: More All
0.8: Testing String Superprimitivity in Parallel - Breslauer (1992) (Correct)
0.6: An On-Line String Superprimitivity Test - Breslauer (1995) (Correct)
0.4: Fast Local Covers - Iliopoulos, Mouchard (1998) (Correct)
Related documents from co-citation: More All
15: line string superprimitivity test - Breslauer, on- - 1992
12: Efficient detection of quasiperiodicities in strings (context) - Apostolico, Ehrenfeucht - 1993
10: An optimal algorithm for computing the repetitions in a word (context) - Crochemore - 1981
BibTeX entry: (Update)
A.Apostolico, M.Farach and C.S.Iliopoulos, Optimal superprimitivity testing for strings, Inform. Process. Lett. 39, 17-20, 1991 http://citeseer.ist.psu.edu/apostolico91optimal.html More
@article{ apostolico91optimal,
author = "Alberto Apostolico and Martin Farach and Costas S. Iliopoulos",
title = "Optimal Superprimitivity Testing for Strings",
journal = "Information Processing Letters",
volume = "39",
number = "1",
pages = "17-20",
year = "1991",
url = "citeseer.ist.psu.edu/apostolico91optimal.html" }
Citations (may not include all citations):135 Combinatorics on Words (context) - Lothaire - 1983
8 E#cient Detection of Quasiperiodicities in Strings (context) - Apostolico, Ehrenfeucht - 1990
1 Optimal O#-line Detection of Repetitions in a String (context) - Apostolico, Preparata - 1983
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rutgers.edu/~farach/papers.html): More
Two Dimensional Dictionary Matching - Amir, Farach (1992) (Correct)
Efficient Algorithms for Inverting Evolution - Farach, Kannan (1999) (Correct)
COFE: A Scalable Method for Feature Extraction from.. - Hristescu, Farach-Colton (2000) (Correct)
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