#1 OPTIMA@HOME About smallexp and smallexpx
Posted: Wed Jul 17, 2013 9:01 pm
Since March, the project carried out calculations associated with the application smallexp.
The scientific problem of smallexp is the experimental calculation of the asymptotic growth of the maximum possible number of fragments in a sequence fixed length. It is important to get information on possible periodic structures. This is necessary for the
development of efficient algorithms search for fragments of small order in character sequences (the order - the ratio of the length of the words to the minimum period). It's important for discrete mathematics. Smallexpx application has more efficient algorithm
then smallexp application.Articles about scientific problem:
R. Kolpakov, G. Kucherov, On Maximal Repetitions in Words, J. Discrete Algorithms 1(1) (2000), 159â186.
R. Kolpakov, G. Kucherov, Periodic structures in words, chapter for the 3rd Lothaire volume Applied Combinatorics on Words, Cambridge University Press, 2005.
M. Crochemore, C. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, Extracting powers and periods in a string from its runs structure, Lecture
Notes in Comput. Sci. 6393
(2010), 258â269.
http://boinc.isa.ru/dcsdg/all_news.php#27
The scientific problem of smallexp is the experimental calculation of the asymptotic growth of the maximum possible number of fragments in a sequence fixed length. It is important to get information on possible periodic structures. This is necessary for the
development of efficient algorithms search for fragments of small order in character sequences (the order - the ratio of the length of the words to the minimum period). It's important for discrete mathematics. Smallexpx application has more efficient algorithm
then smallexp application.Articles about scientific problem:
R. Kolpakov, G. Kucherov, On Maximal Repetitions in Words, J. Discrete Algorithms 1(1) (2000), 159â186.
R. Kolpakov, G. Kucherov, Periodic structures in words, chapter for the 3rd Lothaire volume Applied Combinatorics on Words, Cambridge University Press, 2005.
M. Crochemore, C. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, Extracting powers and periods in a string from its runs structure, Lecture
Notes in Comput. Sci. 6393
(2010), 258â269.
http://boinc.isa.ru/dcsdg/all_news.php#27