Zobrazeno 1 - 10
of 261
pro vyhledávání: '"Maxime, Crochemore"'
Autor:
João A. Carriço, Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Bruno Ribeiro-Gonçalves, Cátia Vaz
Publikováno v:
Algorithms for Molecular Biology, Vol 13, Iss 1, Pp 1-14 (2018)
Abstract Background Microbial typing methods are commonly used to study the relatedness of bacterial strains. Sequence-based typing methods are a gold standard for epidemiological surveillance due to the inherent portability of sequence and allelic p
Externí odkaz:
https://doaj.org/article/5eee9f3877aa4f28959e4fc8178e0793
Autor:
Marie-Pierre Béal, Maxime Crochemore
Publikováno v:
Developments in Language Theory ISBN: 9783031332630
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2291495a3b0408da7bf06dd0d499132
https://doi.org/10.1007/978-3-031-33264-7_5
https://doi.org/10.1007/978-3-031-33264-7_5
Autor:
Maxime Crochemore, Wojciech Rytter
The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as “algorithmic jewels” and deserve reader-friendly presentatio
Autor:
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba
Publikováno v:
Theoretical Computer Science. 866:70-81
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa0d59f07363f9d4b80dc633f1b978c4
https://doi.org/10.1016/j.tcs.2021.03.011
https://doi.org/10.1016/j.tcs.2021.03.011
Autor:
Golnaz Badkobeh, Maxime Crochemore
We extend the left-to-right Lyndon factorisation of a word to the left Lyndon tree construction of a Lyndon word. It yields an algorithm to sort the prefixes of a Lyndon word according to the infinite ordering defined by Dolce et al. (2019). A straig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b7bc13ce006a7632cfbc4fd17fde0a5
https://research.gold.ac.uk/id/eprint/31519/1/LeftLyndonTree-v10.pdf
https://research.gold.ac.uk/id/eprint/31519/1/LeftLyndonTree-v10.pdf
Autor:
Maxime Crochemore, Luís M. S. Russo
Publikováno v:
Theoretical Computer Science. 806:1-9
The article describes the structural and algorithmic relations between Cartesian trees and Lyndon trees. This leads to a uniform presentation of the Lyndon table of a word corresponding to the Next Nearest Smaller table of a sequence of numbers. It s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b9e7e221c32ecaeb6e7b6415bd0bd59
https://doi.org/10.1016/j.tcs.2018.08.011
https://doi.org/10.1016/j.tcs.2018.08.011
Autor:
Golnaz Badkobeh, Maxime Crochemore
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 63, Iss Proc. WORDS 2011, Pp 37-43 (2011)
The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at most r(a).
Externí odkaz:
https://doaj.org/article/2bec3ff67b2e4ebaac74bc05f5fef4f4
Autor:
Wojciech Rytter, Maxime Crochemore, Tomasz Kociumaka, Tomasz Waleń, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Costas S. Iliopoulos
Publikováno v:
Journal of Combinatorial Optimization. 37:501-522
A word of the form WW for some word \(W\in \varSigma ^*\) is called a square, where \(\varSigma \) is an alphabet. A partial word is a word possibly containing holes (also called don’t cares). The hole is a special symbol Open image in new window w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f6fa25672d5cf0c2021327927c9cbf6
https://doi.org/10.1007/s10878-018-0300-z
https://doi.org/10.1007/s10878-018-0300-z
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AH,..., Iss Proceedings (2007)
In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied by Mäkinen and Navarro [Position-Restricted Substring Searching, LATIN 2006]. In the problem handled in this paper, we are intere
Externí odkaz:
https://doaj.org/article/99ff4b13354346168c093ec53d440723