, of x (resp. the factors y[j . . j ] of y) such that i (resp. j) is the center of an odd-length maximal palindrome of x (resp. y) and i (resp. j ) is the ending position of the odd-length
, Create a lexicographically sorted list of such factors of x and
Color set size problem with applications to string matching, 3rd Symposium on Combinatorial Pattern Matching (CPM), vol.644, pp.230-243, 1992. ,
, Algorithms on Strings, Trees, and Sequences -Computer Science and Computational Biology, 1997.
Sublinear space algorithms for the longest common substring problem, 22th European Symposium on Algorithms (ESA), vol.8737, pp.605-617, 2014. ,
Time-space trade-offs for the longest common substring problem, 24th Symposium on Combinatorial Pattern Matching (CPM), vol.7922, pp.223-234, 2013. ,
Suffix tree characterization of maximal motifs in biological sequences, Theoretical Computer Science, vol.410, issue.43, pp.4391-4401, 2009. ,
Linear-time algorithm for long LCF with k mismatches, 29th Symposium on Combinatorial Pattern Matching (CPM), vol.105, p.16, 2018. ,
A provably efficient algorithm for the k -mismatch average common substring problem, Journal of Computational Biology, vol.23, issue.6, pp.472-482, 2016. ,
Algorithmic framework for approximate matching under bounded edits with applications to sequence analysis, 22nd Conference on Research in Computational Molecular Biology (RECOMB), vol.10812, pp.211-224, 2018. ,
Longest common prefixes with k-errors and applications, 25th Symposium on String Processing and Information Retrieval (SPIRE), vol.11147, pp.27-41, 2018. ,
Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array, 12th Symposium String Processing and Information Retrieval (SPIRE), vol.3772, pp.179-190, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00328129
Lossless filter for multiple repetitions with Hamming distance, Journal of Discrete Algorithms, vol.6, issue.3, pp.497-509, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00179731
Computing a longest common palindromic subsequence, Fundamenta Informaticae, vol.129, issue.4, pp.329-340, 2014. ,
On finding a longest common palindromic subsequence, Theoretical Computer Science, vol.710, pp.29-34, 2018. ,
A hardness result and new algorithm for the longest common palindromic subsequence problem, Information Processing Letters, vol.129, pp.11-15, 2018. ,
Computing longest common square subsequences, 29th Symposium on Combinatorial Pattern Matching (CPM), vol.105, pp.1-15, 2018. ,
Scoring schemes of palindrome clusters for more sensitive prediction of replication origins in herpesviruses, Nucleic Acids Research, vol.33, issue.15, p.134, 2005. ,
, Applied Combinatorics on Words, Encyclopedia of Mathematics and its Applications, 2005.
Longest property-preserved common factor, 25th Symposium on String Processing and Information Retrieval (SPIRE), vol.11147, pp.42-49, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01921603
On longest common property preserved substring queries, 26th International Symposium on String Processing and Information Retrieval (SPIRE), pp.162-174, 2019. ,
The "runs" theorem, SIAM Journal on Computing, vol.46, issue.5, pp.1501-1514, 2017. ,
Finding maximal repetitions in a word in linear time, 40th Symposium on Foundations Of Computer Science (FOCS), pp.596-604, 1999. ,
URL : https://hal.archives-ouvertes.fr/inria-00098853
Optimal suffix tree construction with large alphabets, 38th Symposium on Foundations Of Computer Science (FOCS, pp.137-143, 1997. ,
Sublinear approximate string matching and biological applications, Algorithmica, vol.12, issue.4, pp.327-344, 1994. ,
Indexed matching statistics and shortest unique substrings, 21st Symposium on String Processing and Information Retrieval (SPIRE), vol.8799, pp.179-190, 2014. ,
Suffix tree characterization of maximal motifs in biological sequences, Theoretical Computer Science, vol.410, issue.43, pp.4391-4401, 2009. ,
Perfect hashing for strings: Formalization and algorithms, 7th Symposium on Combinatorial Pattern Matching (CPM), vol.1075, pp.130-140, 1996. ,
A linear time algorithm for seeds computation ,
On prefix/suffix-square free words, 22nd Symposium on String Processing and Information Retrieval (SPIRE), vol.9309, pp.54-66, 2015. ,
Lineartime computation of local periods, Theoretical Computer Science, vol.326, issue.1, pp.229-240, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00099598
, 29th Symposium on Combinatorial Pattern Matching (CPM), vol.105, p.14, 2018.
Longest Common Substring Made Fully Dynamic, 27th Annual European Symposium on Algorithms (ESA), vol.144, p.17, 2019. ,
, Degenerate string comparison and applications, in: 18th Workshop on Algorithms in Bioinformatics (WABI), vol.113, p.14, 2018.
, 13th Latin American Symposium on Theoretical INformatics (LATIN), vol.10807, pp.290-302, 2018.
Longest Unbordered Factor in Quasilinear Time, 29th International Symposium on Algorithms and Computation (ISAAC 2018), vol.123, pp.1-70, 2018. ,
Efficient seed computation revisited, Theoretical Computer Science, vol.483, pp.171-181, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01616469
Open and closed words, Bulletin of the EATCS, vol.123, 2017. ,