Fine and Wilf’s Theorem and Pseudo-repetitions.

Tools

Manea, Florin, Mercaş, Robert and Nowotka, Dirk (2012) Fine and Wilf’s Theorem and Pseudo-repetitions. [Paper] In: Mathematical Foundations of Computer Science (MFCS). , 27-31 Aug 2012, Bratislava, Slovakia . Mathematical Foundations of Computer Science 2012. ; pp. 668-680 . DOI 10.1007/978-3-642-32589-2_58. Lecture Notes in Computer Science .

[thumbnail of FineAndWilfPseudoReps.pdf]
Preview
 Text
FineAndWilfPseudoReps.pdf
Download (311kB) | Preview

Supplementary data:

Abstract

Pseudo-repetitions are a generalization of the fundamental notion of repetitions in sequences. We develop the algorithmic foundations for questions on pseudo-repetitions and extend the work by L. Kari et.al. on the combinatorial properties of pseudo-repetitions, who investigated a restricted version of that notion in the context of bioinformatics.

Document Type: Conference or Workshop Item (Paper)
Keywords: combinatorics on words Fine and Wilf's theorem pseudo-repetitions
Research affiliation: Kiel University
Publisher: Springer
Date Deposited: 21 Jan 2013 12:47
Last Modified: 23 Sep 2019 21:36
URI: https://oceanrep.geomar.de/id/eprint/20162

Actions (login required)

View Item View Item