Approximate period detection and correction

Authors:
Amihood Amir;Avivit Levy
Affiliations:
Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel,Department of Computer Science, Johns Hopkins University, Baltimore, MD;Department of Software Engineering, Shenkar College, Ramat-Gan, Israel,CRI, Haifa University, Mount Carmel, Haifa, Israel
Venue:
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Year:
2012

Citing 21
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
Improved string matching with k mismatches

ACM SIGACT News
Efficient string matching with k mismatches

Theoretical Computer Science
Alphabet-Independent Two-Dimensional Witness Computation

SIAM Journal on Computing
Sorting permutations by block-interchanges

Information Processing Letters
Two-Dimensional Periodicity in Rectangular Arrays

SIAM Journal on Computing
Sorting by Transpositions

SIAM Journal on Discrete Mathematics
Pattern matching with swaps

Journal of Algorithms
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A Unifying Look at d-Dimensional Periodicities and Space Coverings

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Fast Sorting by Reversal

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Finding approximate repetitions under Hamming distance

Theoretical Computer Science - Logic and complexity in computer science
Pattern matching with address errors: rearrangement distances

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Tandem repeats over the edit distance

Bioinformatics
Periodicity and repetitions in parameterized strings

Discrete Applied Mathematics
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Simple linear work suffix array construction

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the cost of interchange rearrangement in strings

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Cycle detection and correction

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Finding longest approximate periodic patterns

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Closest periodic vectors in l

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Periodicity has been historically well studied and has numerous applications. In nature, however, few cyclic phenomena have an exact period. This paper surveys some recent results in approximate periodicity: concept definition, discovery or recovery, techniques and efficient algorithms. We will also show some interesting connections between error correction codes and periodicity. We will try to pinpoint the issues involved, the context in the literature, and possible future research directions.