ResearcherID Thomson Reuters  

Crochemore, Maxime
Create a ResearcherID badge for this researcher View publications analytics for this researcher
Close
ResearcherID: K-2041-2017
Other Names: Max
E-mail:
URL: http://www.researcherid.com/rid/K-2041-2017
Subject: Computer Science; Mathematical & Computational Biology
Keywords: algorithms; text alignment; text compression; text and data mining; string algorithms; strings; automata theory; text processing
ORCID: http://orcid.org/0000-0003-1087-1419
My Institutions (more details)
Primary Institution:
Sub-org/Dept: Informatics
Role:
Joint Affiliation:
Sub-org/Dept:
Role:
Description:
My URLs: https://nms.kcl.ac.uk/maxime.crochemore/
 
 

This list contains papers that I have authored.

publication(s)  
First Page Previous Page Page   of  28  Go Next Page Last Page
  Sort by:    Results per page: 
1.  Title: Counting maximal-exponent factors in words
 Author(s): Badkobeh, G.; Crochemore, M.; Mercas, R.
 Source: Theoretical Computer Science Volume: 658 Pages: 27-35 Published: 2017
 Times Cited: 0
 DOI: 10.1016/j.tcs.2016.02.035
added
23-Jun-17
2.  Title: The longest common substring problem
 Author(s): Crochemore, M.; Iliopoulos, C. S.; Langiu, A.; et al.
 Source: Mathematical Structures in Computer Science Volume: 27 Issue: 2 Pages: 277-295 Published: 2017
 Times Cited: 0
 DOI: 10.1017/s0960129515000110
added
23-Jun-17
3.  Title: 40 Years of Suffix Trees
 Author(s): Apostolico, A.; Crochemore, M.; Farach-Colton, M.; et al.
 Source: Communications of the Acm Volume: 59 Issue: 4 Pages: 66-73 Published: 2016
 Times Cited: 4
 DOI: 10.1145/2810036
added
23-Jun-17
4.  Title: Absent words and the (dis)similarity analysis of DNA sequences: an experimental study
 Author(s): Rahman, Mohammad Saifur; Alatabbi, Ali; Athar, Tanver; et al.
 Source: {BMC} Bioinformatics Notes Volume: 9 Issue: 1 Pages: 1-8 Published: 2016
 Author-provided URL : http://dx.doi.org/10.1186/s13104-016-1972-z
added
20-Jun-17
5.  Title: Computing maximal-exponent factors in an overlap-free word
 Author(s): Badkobeh, G.; Crochemore, M.
 Source: Journal of Computer and System Sciences Volume: 82 Issue: 3 Pages: 477-487 Published: 2016
 Times Cited: 2
 DOI: 10.1016/j.jcss.2015.11.007
added
23-Jun-17
6.  Title: Efficient computation of maximal anti-exponent in palindrome-free strings
 Author(s): Badkobeh, G.; Crochemore, M.; Mohamed, M.; et al.
 Source: Theoretical Computer Science Volume: 656 Pages: 241-248 Published: 2016
 Times Cited: 0
 DOI: 10.1016/j.tcs.2016.02.014
added
23-Jun-17
7.  Title: Linear algorithm for conservative degenerate pattern matching
 Author(s): Crochemore, M.; Iliopoulos, C. S.; Kundu, R.; et al.
 Source: Engineering Applications of Artificial Intelligence Volume: 51 Pages: 109-114 Published: 2016
 Times Cited: 1
 DOI: 10.1016/j.engappai.2016.01.009
added
23-Jun-17
8.  Title: Linear-size suffix tries
 Author(s): Crochemore, M.; Epifanio, C.; Grossi, R.; et al.
 Source: Theoretical Computer Science Volume: 638 Pages: 171-178 Published: 2016
 Times Cited: 0
 DOI: 10.1016/j.tcs.2016.04.002
added
23-Jun-17
9.  Title: Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
 Author(s): Crochemore, Maxime; Fici, Gabriele; Mercas, Robert; et al.
 Conference: LATIN Volume: 9644 Pages: 334-346 Year: 2016
added
20-Jun-17
10.  Title: Multiple String Matching
 Author(s): Crochemore, Maxime; Lecroq, Thierry
 Source: Encyclopedia of Algorithms Pages: 1378-1382 Published: 2016
 Author-provided URL : http://dx.doi.org/10.1007/978-1-4939-2864-4_366
added
20-Jun-17
publication(s)  
First Page Previous Page Page   of  28  Go Next Page Last Page
  Sort by:    Results per page: