Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlberto Apostolico
Person information
- affiliation: Georgia Tech, USA
- affiliation: Purdue University, West Lafayette, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
[j86]Amihood Amir, Alberto Apostolico, Travis Gagie
, Gad M. Landau:
String cadences. Theor. Comput. Sci. 698: 4-8 (2017)- 2016
- [j85]Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan:
40 years of suffix trees. Commun. ACM 59(4): 66-73 (2016) - [j84]Sharma V. Thankachan, Sriram P. Chockalingam, Yongchao Liu, Alberto Apostolico, Srinivas Aluru:
ALFRED: A Practical Method for Alignment-Free Distance Computation. J. Comput. Biol. 23(6): 452-460 (2016) - [j83]Sharma V. Thankachan, Alberto Apostolico, Srinivas Aluru:
A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem. J. Comput. Biol. 23(6): 472-482 (2016) - [j82]Alberto Apostolico, Concettina Guerra, Gad M. Landau, Cinzia Pizzi:
Sequence similarity measures based on bounded hamming distance. Theor. Comput. Sci. 638: 76-90 (2016) - [j81]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. Theor. Comput. Sci. 656: 146-159 (2016) - [r1]Alberto Apostolico, Fabio Cunial:
Suffix Trees and Arrays. Encyclopedia of Algorithms 2016: 2154-2162 - [i7]Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau:
String Cadences. CoRR abs/1610.03337 (2016) - 2015
- [j80]Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom:
A PTAS for the Square Tiling Problem. Theor. Comput. Sci. 562: 33-45 (2015) - [c44]Srinivas Aluru, Alberto Apostolico, Sharma V. Thankachan:
Efficient Alignment Free Sequence Comparison with Bounded Mismatches. RECOMB 2015: 1-12 - 2014
- [j79]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. J. Comput. Syst. Sci. 80(7): 1245-1253 (2014) - [j78]Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons:
Modulated string searching. Theor. Comput. Sci. 525: 23-29 (2014) - [j77]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting approximate periodic patterns. Theor. Comput. Sci. 525: 60-67 (2014) - [c43]Alberto Apostolico, Concettina Guerra, Cinzia Pizzi:
Alignment Free Sequence Similarity with Bounded Hamming Distance. DCC 2014: 183-192 - [c42]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. SPIRE 2014: 45-51 - 2013
- [j76]Alberto Apostolico, Matteo Comin, Andreas W. M. Dress, Laxmi Parida:
Ultrametric networks: a new tool for phylogenetic analysis. Algorithms Mol. Biol. 8: 7 (2013) - [c41]Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan:
Forty Years of Text Indexing. CPM 2013: 1-10 - [i6]Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons:
Modulated String Searching. CoRR abs/1302.3437 (2013) - 2012
- [j75]Fabio Cunial, Alberto Apostolico:
Phylogeny Construction with Rigid Gapped Motifs. J. Comput. Biol. 19(7): 911-927 (2012) - [j74]Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták, Cinzia Pizzi:
Efficient algorithms for the periodic subgraphs mining problem. J. Discrete Algorithms 17: 24-30 (2012) - [j73]Alberto Apostolico, Péter L. Erdös, Alpár Jüttner:
Parameterized searching with mismatches for run-length encoded strings. Theor. Comput. Sci. 454: 23-29 (2012) - [c40]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting Approximate Periodic Patterns. MedAlg 2012: 1-12 - [i5]Alberto Apostolico, Andreas W. M. Dress, Laxmi Parida:
Structure Discovery in Biology: Motifs, Networks & Phylogenies (Dagstuhl Seminar 12291). Dagstuhl Reports 2(7): 92-117 (2012) - 2011
- [j72]Alberto Apostolico, Cinzia Pizzi, Esko Ukkonen:
Efficient algorithms for the discovery of gapped factors. Algorithms Mol. Biol. 6: 5 (2011) - [j71]Alberto Apostolico, Manuel Barbares, Cinzia Pizzi:
Speedup for a periodic subgraph miner. Inf. Process. Lett. 111(11): 521-523 (2011) - [c39]Alessia Amelio, Alberto Apostolico, Simona E. Rombo:
Image Compression by 2D Motif Basis. DCC 2011: 153-162 - [c38]Alberto Apostolico, Fabio Cunial:
Sequence Similarity by Gapped LZW. DCC 2011: 343-352 - [c37]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. ISAAC 2011: 683-692 - 2010
- [j70]Alberto Apostolico, Claudia Tagliacollo:
Optimal Extraction of Irredundant Motif Bases. Int. J. Found. Comput. Sci. 21(6): 1035-1047 (2010) - [j69]Alberto Apostolico, Fabio Cunial:
The Subsequence Composition of Polypeptides. J. Comput. Biol. 17(8): 1011-1049 (2010) - [j68]Alberto Apostolico, Matteo Comin, Laxmi Parida:
VARUN: Discovering Extensible Motifs under Saturation Constraints. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 752-762 (2010) - [c36]Alberto Apostolico:
Maximal Words in Sequence Comparisons Based on Subword Composition. Algorithms and Applications 2010: 34-44 - [c35]Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom:
A PTAS for the Square Tiling Problem. SPIRE 2010: 118-126 - [c34]Alberto Apostolico, Péter L. Erdös, Alpár Jüttner:
Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract). SPIRE 2010: 365-371 - [e10]Alberto Apostolico, Andreas W. M. Dress, Laxmi Parida:
Structure Discovery in Biology: Motifs, Networks & Phylogenies, 06.06. - 11.06.2010. Dagstuhl Seminar Proceedings 10231, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i4]Alberto Apostolico, Andreas W. M. Dress, Laxmi Parida:
10231 Abstracts Collection - Structure Discovery in Biology: Motifs, Networks & Phylogenies. Structure Discovery in Biology: Motifs, Networks & Phylogenies 2010
2000 – 2009
- 2009
- [j67]Alberto Apostolico, Guido Drovandi:
Graph Compression by BFS. Algorithms 2(3): 1031-1044 (2009) - [j66]Alberto Apostolico:
Ask Not What Stringology Can Do for You: Advances in Pattern Matching Driven by Computational Biology. Commun. Inf. Syst. 9(3): 235-252 (2009) - [j65]Joong Chae Na, Kangho Roh, Alberto Apostolico, Kunsoo Park:
Alignment of biological sequences with quality scores. Int. J. Bioinform. Res. Appl. 5(1): 97-113 (2009) - [j64]Alberto Apostolico, Giorgio Satta:
Discovering subword associations in strings in time linear in the output size. J. Discrete Algorithms 7(2): 227-238 (2009) - [j63]Alberto Apostolico, Fabio Cunial:
The subsequence composition of a string. Theor. Comput. Sci. 410(43): 4360-4371 (2009) - [c33]Alberto Apostolico:
Monotony and Surprise. Algorithmic Bioprocesses 2009: 15-29 - [c32]Alberto Apostolico, Fabio Cunial:
Probing the Randomness of Proteins by Their Subsequence Composition. DCC 2009: 173-182 - 2008
- [j62]Alberto Apostolico, Olgert Denas:
Fast algorithms for computing sequence distances by exhaustive substring composition. Algorithms Mol. Biol. 3 (2008) - [j61]Alberto Apostolico, Raffaele Giancarlo:
Periodicity and repetitions in parameterized strings. Discret. Appl. Math. 156(9): 1389-1398 (2008) - [j60]Alberto Apostolico, Cinzia Pizzi:
Scoring Unusual Words with Varying Mismatch Errors. Math. Comput. Sci. 1(4): 639-653 (2008) - [j59]Alberto Apostolico, Laxmi Parida, Simona E. Rombo:
Motif patterns in 2D. Theor. Comput. Sci. 390(1): 40-55 (2008) - [j58]Alberto Apostolico, Claudia Tagliacollo:
Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2logn) time. Theor. Comput. Sci. 408(2-3): 106-115 (2008) - [c31]Alberto Apostolico, Fabio Cunial, Vineith Kaul:
Table Compression by Record Intersections. DCC 2008: 13-22 - [c30]Alberto Apostolico, Olgert Denas:
Sequence distances based on exhaustive substring composition. ITW 2008: 95-98 - 2007
- [j57]Alberto Apostolico, Raffaele Giancarlo, Concettina Guerra, Giuseppe Lancia:
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology - Preface. BMC Bioinform. 8(S-5) (2007) - [j56]Alberto Apostolico, Cinzia Pizzi:
Motif discovery by monotone scores. Discret. Appl. Math. 155(6-7): 695-706 (2007) - [j55]Alberto Apostolico:
Fast gapped variants for Lempel-Ziv-Welch compression. Inf. Comput. 205(7): 1012-1026 (2007) - [j54]Alberto Apostolico:
Preface. J. Comput. Biol. 14(5): 537-538 (2007) - [j53]Alberto Apostolico:
Preface. J. Comput. Biol. 14(6): 699-700 (2007) - [j52]Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein:
Parameterized matching with mismatches. J. Discrete Algorithms 5(1): 135-140 (2007) - [j51]Alberto Apostolico, Ricardo A. Baeza-Yates, Massimo Melucci:
2004 Symposium on String Processing and Information Retrieval. J. Discrete Algorithms 5(2): 203 (2007) - [c29]Alberto Apostolico, Claudia Tagliacollo:
Optimal Offline Extraction of Irredundant Motif Bases. COCOON 2007: 360-371 - [c28]Alberto Apostolico, Claudia Tagliacollo:
Incremental Discovery of Irredundant Motif Bases in Time O(|Sigma| n2 log n). WABI 2007: 136-148 - 2006
- [j50]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Mining, compressing and classifying with extensible motifs. Algorithms Mol. Biol. 1 (2006) - [j49]Alberto Apostolico, Ricardo A. Baeza-Yates, Massimo Melucci:
Advances in information retrieval: An introduction to the special issue. Inf. Syst. 31(7): 569-572 (2006) - [c27]Alberto Apostolico, Yongwook Choi:
Textual Compression by Collapsible Tries. DCC 2006: 437 - [c26]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Bridging Lossy and Lossless Compression by Motif Pattern Discovery. GTIT-C 2006: 793-813 - [c25]Alberto Apostolico, Yongwook Choi:
Compressing with Collapsible Tries. ITW 2006: 92-96 - [e9]Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006. Dagstuhl Seminar Proceedings 06201, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e8]Alberto Apostolico, Concettina Guerra, Sorin Istrail, Pavel A. Pevzner, Michael S. Waterman:
Research in Computational Molecular Biology, 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings. Lecture Notes in Computer Science 3909, Springer 2006, ISBN 3-540-33295-2 [contents] - [i3]Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - [i2]Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - [i1]Alberto Apostolico, Cinzia Pizzi:
On the Monotonicity of the String Correction Factor for Words with Mismatches. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - 2005
- [j48]Alberto Apostolico, Valentin E. Brimkov:
Optimal discovery of repetitions in 2D. Discret. Appl. Math. 151(1-3): 5-20 (2005) - [j47]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Bridging Lossy and Lossless Compression by Motif Pattern Discovery. Electron. Notes Discret. Math. 21: 219-225 (2005) - [j46]Alberto Apostolico, Raffaele Giancarlo:
Periodicity and Repetitions in Parameterized Strings. Electron. Notes Discret. Math. 21: 227-230 (2005) - [j45]Alberto Apostolico, Raffaele Giancarlo:
Foreword: Pattern Discovery in the Post Genome. Theor. Comput. Sci. 335(1): 1-2 (2005) - [c24]Alberto Apostolico:
Monotony and Surprise. COCOON 2005: 9 - [c23]Alberto Apostolico:
Of Lempel-Ziv-Welch Parses with Refillable Gaps. DCC 2005: 338-347 - [c22]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Off-Line Compression by Extensible Motifs. DCC 2005: 450 - [c21]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Conservative extraction of over-represented extensible motifs. ISMB (Supplement of Bioinformatics) 2005: 9-18 - [e7]Alberto Apostolico, Maxime Crochemore, Kunsoo Park:
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings. Lecture Notes in Computer Science 3537, Springer 2005, ISBN 3-540-26201-6 [contents] - 2004
- [j44]Alberto Apostolico, Laxmi Parida:
Incremental Paradigms of Motif Discovery. J. Comput. Biol. 11(1): 15-25 (2004) - [j43]Alberto Apostolico, Fang-Cheng Gong, Stefano Lonardi:
Verbumculus and the Discovery of Unusual Words. J. Comput. Sci. Technol. 19(1): 22-41 (2004) - [c20]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Motifs in Ziv-Lempel-Welch Clef. Data Compression Conference 2004: 72-81 - [c19]Alberto Apostolico, Cinzia Pizzi, Giorgio Satta:
Optimal Discovery of Subword Associations in Strings. Discovery Science 2004: 270-277 - [c18]Alberto Apostolico, Cinzia Pizzi:
Monotone Scoring of Patterns with Mismatches: (Extended Abstract). WABI 2004: 87-98 - [e6]Alberto Apostolico, Massimo Melucci:
String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004, Proceedings. Lecture Notes in Computer Science 3246, Springer 2004, ISBN 3-540-23210-9 [contents] - 2003
- [j42]Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi:
Monotony of Surprise and Large-Scale Quest for Unusual Words. J. Comput. Biol. 10(3/4): 283-311 (2003) - [j41]Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta:
Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 1(5-6): 409-421 (2003) - [j40]Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park:
Truncated suffix trees and their application to data compression. Theor. Comput. Sci. 304(1-3): 87-101 (2003) - [c17]Alberto Apostolico, Laxmi Parida:
Compression and the Wheel of Fortune. DCC 2003: 143-152 - 2002
- [j39]Alberto Apostolico, Mikhail J. Atallah:
Compact Recognizers of Episode Sequences. Inf. Comput. 174(2): 180-192 (2002) - [j38]Alberto Apostolico, Stefano Lonardi:
A speed-up for the commute between subword trees and DAWGs. Inf. Process. Lett. 83(3): 159-161 (2002) - [c16]Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi:
Monotony of surprise and large-scale quest for unusual words. RECOMB 2002: 22-31 - [e5]Alberto Apostolico, Masayuki Takeda:
Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings. Lecture Notes in Computer Science 2373, Springer 2002, ISBN 3-540-43862-9 [contents] - 2001
- [c15]Alberto Apostolico:
Of Maps Bigger than the Empire (Invited Paper). SPIRE 2001: 2-9 - 2000
- [j37]Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi, Xuyan Xu:
Efficient Detection of Unusual Words. J. Comput. Biol. 7(1-2): 71-94 (2000) - [j36]Alberto Apostolico, Gill Bejerano:
Optimal Amnesic Probabilistic Automata or How to Learn and Classify Proteins in Linear Time and Space. J. Comput. Biol. 7(3-4): 381-393 (2000) - [j35]Alberto Apostolico, Stefano Lonardi:
Off-line compression by greedy textual substitution. Proc. IEEE 88(11): 1733-1744 (2000) - [j34]Alberto Apostolico, Valentin E. Brimkov:
Fibonacci arrays and their two-dimensional repetitions. Theor. Comput. Sci. 237(1-2): 263-273 (2000) - [c14]Alberto Apostolico, Stefano Lonardi:
Compression of Biological Sequences by Greedy Off-Line Textual Substitution. Data Compression Conference 2000: 143-152 - [c13]Alberto Apostolico:
Notes on Learning Probabilistic Automata. Data Compression Conference 2000: 545 - [c12]Alberto Apostolico, Gill Bejerano:
Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. RECOMB 2000: 25-32
1990 – 1999
- 1999
- [j33]Alberto Apostolico, Gad M. Landau, Steven Skiena:
Matching for Run-Length Encoded Strings. J. Complex. 15(1): 4-16 (1999) - [c11]Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi:
Linear Global Detectors of Redundant and Rare Substrings. Data Compression Conference 1999: 168-177 - [p4]Alberto Apostolico:
General Pattern Matching. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j32]Alberto Apostolico, Raffaele Giancarlo:
Seqeunce Alignment in Molecular Biology. J. Comput. Biol. 5(2): 173-196 (1998) - [c10]Alberto Apostolico, Stefano Lonardi:
Some Theory and Practice of Greedy Off-Line Textual Substitution. Data Compression Conference 1998: 119-128 - [c9]Alberto Apostolico, Raffaele Giancarlo:
Sequence alignment in molecular biology. Mathematical Support for Molecular Biology 1998: 85-115 - 1997
- [j31]Amihood Amir, Alberto Apostolico, Moshe Lewenstein:
Inverse Pattern Matching. J. Algorithms 24(2): 325-339 (1997) - [c8]Alberto Apostolico, Dany Breslauer:
Of Periods, Quasiperiods, Repetitions and Covers. Structures in Logic and Computer Science 1997: 236-248 - [c7]Alberto Apostolico, Mary Ellen Bock, Xuyan Xu:
Annotated statistical indices for sequence analysis. SEQUENCES 1997: 215-229 - [c6]Alberto Apostolico, Gad M. Landau, Steven Skiena:
Matching for run-length encoded strings. SEQUENCES 1997: 348-356 - [p3]Alberto Apostolico:
On-line string searching. Pattern Matching Algorithms 1997: 89-122 - [p2]Alberto Apostolico, Mikhail J. Atallah:
Parallel computations of Levenshtein distances. Pattern Matching Algorithms 1997: 143-184 - [p1]Alberto Apostolico:
String Editing and Longest Common Subsequences. Handbook of Formal Languages (2) 1997: 361-398 - [e4]Alberto Apostolico, Zvi Galil:
Pattern Matching Algorithms. Oxford University Press 1997, ISBN 978-019-511367-9 [contents] - [e3]Alberto Apostolico, Jotun Hein:
Combinatorial Pattern Matching, 8th Annual Symposium, CPM 97, Aarhus, Denmark, June 30 - July 2, 1997, Proceedings. Lecture Notes in Computer Science 1264, Springer 1997, ISBN 3-540-63220-4 [contents] - 1996
- [j30]Alberto Apostolico, Franco P. Preparata:
Data Structures and Algorithms for the String Statistics Problem. Algorithmica 15(5): 481-494 (1996) - [j29]Alberto Apostolico, Dany Breslauer:
An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String. SIAM J. Comput. 25(6): 1318-1331 (1996) - 1995
- [j28]Alberto Apostolico, Maxime Crochemore:
Fast Parallel Lyndon Factorization with Applications. Math. Syst. Theory 28(2): 89-108 (1995) - [j27]Alberto Apostolico, Dany Breslauer, Zvi Galil:
Parallel Detection of all Palindromes in a String. Theor. Comput. Sci. 141(1&2): 163-173 (1995) - [c5]Alberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo:
An International Masters in Software Engineering: Experience and Prospects. ICDE 1995: 556-557 - 1994
- [j26]Alberto Apostolico:
Guest Editor's Foreword: Special Issue on String Algorithmics and Its Applications. Algorithmica 12(4/5): 245-246 (1994) - [j25]Alberto Apostolico, Giuseppe F. Italiano, Giorgio Gambosi, Maurizio Talamo:
The Set Union Problem With Unlimited Backtracking. SIAM J. Comput. 23(1): 50-70 (1994) - [c4]Alberto Apostolico, Dany Breslauer, Zvi Galil:
Parallel Detection of all Palindromes in a String. STACS 1994: 497-506 - 1993
- [j24]Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch:
New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24). Discret. Appl. Math. 41(2): 179-180 (1993) - [j23]Alberto Apostolico:
Efficient CRCW-PRAM Algorithms for Universal Substring Searching. Theor. Comput. Sci. 108(2): 331-344 (1993) - [j22]Alberto Apostolico, Andrzej Ehrenfeucht:
Efficient Detection of Quasiperiodicities in Strings. Theor. Comput. Sci. 119(2): 247-265 (1993) - [e2]