Where did the author of 'Off-line serial exact string searching' earn his PhD degree?
University of Rouen
Maxime Crochemore et al.: The Rightmost Equal-Cost Position Problem. (2008) authored by Maxime Crochemore. Anisa Al-Hafeedh et al.: A comparison of index-based lempel-Ziv LZ77 factorization algorithms. (2016) authored by Maxime Crochemore. Maxime Crochemore et al.: A Trie-Based Approach for Compacting Automata. (1989) authored by Maxime Crochemore. A. Cardon and Maxime Crochemore: Towards a Solution to the "Runs" Conjecture. (2011) authored by Maxime Crochemore. Michalis Christou et al.: Computing all subtree repeats in ordered Ranked Trees. (2012) authored by Maxime Crochemore. Maxime Crochemore and Ely Porat: A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence problem. (2008) authored by Maxime Crochemore. Supaporn Chairungsee and Maxime Crochemore: A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence problem. (2001) authored by Maxime Crochemore. Maxime Crochemore was a senior research fellow at King<unk>'s College London from 2002–2007. He is the author of Ali Alatabbi et al.: Overlapping repetitions in weighted sequence. (2012) authored by Crochemore. he is a professor since 2007 and he is a professor since 2007.
[INST]
Utilize the provided context information, to generate answers to the following question: 
- Generate the answer to the question based on the provided context.
- Avoid including any explanations or apologies in your responses.
- Only respond to questions that ask for the answer to the target question without any additional information.
- Strictly provide the answer without any additional text.
Question: Where did the author of 'Off-line serial exact string searching' earn his PhD degree?
Context: Maxime Crochemore et al.: The Rightmost Equal-Cost Position Problem. (2008) authored by Maxime Crochemore. Anisa Al-Hafeedh et al.: A comparison of index-based lempel-Ziv LZ77 factorization algorithms. (2016) authored by Maxime Crochemore. Maxime Crochemore et al.: A Trie-Based Approach for Compacting Automata. (1989) authored by Maxime Crochemore. A. Cardon and Maxime Crochemore: Towards a Solution to the "Runs" Conjecture. (2011) authored by Maxime Crochemore. Michalis Christou et al.: Computing all subtree repeats in ordered Ranked Trees. (2012) authored by Maxime Crochemore. Maxime Crochemore and Ely Porat: A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence problem. (2008) authored by Maxime Crochemore. Supaporn Chairungsee and Maxime Crochemore: A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence problem. (2001) authored by Maxime Crochemore. Maxime Crochemore was a senior research fellow at King<unk>'s College London from 2002–2007. He is the author of Ali Alatabbi et al.: Overlapping repetitions in weighted sequence. (2012) authored by Crochemore. he is a professor since 2007 and he is a professor since 2007.
[/INST] Answer:
