Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Mathieu Raffinot
@inproceedings{DBLP:conf/spire/BlinPRU23,
author = {Guillaume Blin and
Alexandru Popa and
Mathieu Raffinot and
Raluca Uricaru},
editor = {Franco Maria Nardini and
Nadia Pisanti and
Rossano Venturini},
title = {Approximation and Fixed Parameter Algorithms for the Approximate Cover
Problem},
booktitle = {String Processing and Information Retrieval - 30th International Symposium,
{SPIRE} 2023, Pisa, Italy, September 26-28, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14240},
pages = {75--88},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43980-3\_7},
doi = {10.1007/978-3-031-43980-3\_7},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/BlinPRU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SolanoBRCC20,
author = {Geoffrey Solano and
Guillaume Blin and
Mathieu Raffinot and
Jhoirene B. Clemente and
Jaime Caro},
title = {On the Approximability of the Minimum Weight {\textdollar}t{\textdollar}-partite
Clique Problem},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {171--190},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00525},
doi = {10.7155/JGAA.00525},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/SolanoBRCC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/CasteigtsRS20,
author = {Arnaud Casteigts and
Mathieu Raffinot and
Jason Schoeters},
editor = {Cristina Maria Pinotti and
Alfredo Navarra and
Amitabha Bagchi},
title = {VectorTSP: {A} Traveling Salesperson Problem with Racetrack-Like Acceleration
Constraints},
booktitle = {Algorithms for Sensor Systems - 16th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS} 2020,
Pisa, Italy, September 9-10, 2020, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {12503},
pages = {45--59},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-62401-9\_4},
doi = {10.1007/978-3-030-62401-9\_4},
timestamp = {Mon, 02 Nov 2020 18:31:59 +0100},
biburl = {https://dblp.org/rec/conf/algosensors/CasteigtsRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-03666,
author = {Arnaud Casteigts and
Mathieu Raffinot and
Jason Schoeters},
title = {VectorTSP: {A} Traveling Salesperson Problem with Racetrack-like acceleration
constraints},
journal = {CoRR},
volume = {abs/2006.03666},
year = {2020},
url = {https://arxiv.org/abs/2006.03666},
eprinttype = {arXiv},
eprint = {2006.03666},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-03666.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-00060,
author = {Tristan Braquelaire and
Marie Gasparoux and
Mathieu Raffinot and
Raluca Uricaru},
title = {On improving the approximation ratio of the r-shortest common superstring
problem},
journal = {CoRR},
volume = {abs/1805.00060},
year = {2018},
url = {http://arxiv.org/abs/1805.00060},
eprinttype = {arXiv},
eprint = {1805.00060},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-00060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/BelazzouguiCGPR17,
author = {Djamal Belazzougui and
Fabio Cunial and
Travis Gagie and
Nicola Prezza and
Mathieu Raffinot},
editor = {Jarkko Kari and
Florin Manea and
Ion Petre},
title = {Flexible Indexing of Repetitive Collections},
booktitle = {Unveiling Dynamics and Complexity - 13th Conference on Computability
in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10307},
pages = {162--174},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-58741-7\_17},
doi = {10.1007/978-3-319-58741-7\_17},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/BelazzouguiCGPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BraquelaireGRU17,
author = {Tristan Braquelaire and
Marie Gasparoux and
Mathieu Raffinot and
Raluca Uricaru},
editor = {T. V. Gopal and
Gerhard J{\"{a}}ger and
Silvia Steila},
title = {On the Shortest Common Superstring of {NGS} Reads},
booktitle = {Theory and Applications of Models of Computation - 14th Annual Conference,
{TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10185},
pages = {97--111},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-55911-7\_8},
doi = {10.1007/978-3-319-55911-7\_8},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/BraquelaireGRU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-04586,
author = {Mathieu Raffinot and
Romain Rivi{\`{e}}re},
title = {Optimizing Google Shopping Campaigns Structures With Query-Level Matching},
journal = {CoRR},
volume = {abs/1708.04586},
year = {2017},
url = {http://arxiv.org/abs/1708.04586},
eprinttype = {arXiv},
eprint = {1708.04586},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-04586.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BelazzouguiKR16,
author = {Djamal Belazzougui and
Roman Kolpakov and
Mathieu Raffinot},
title = {Indexing and querying color sets of images},
journal = {Theor. Comput. Sci.},
volume = {647},
pages = {74--84},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.07.041},
doi = {10.1016/J.TCS.2016.07.041},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BelazzouguiKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BelazzouguiCGPR16,
author = {Djamal Belazzougui and
Fabio Cunial and
Travis Gagie and
Nicola Prezza and
Mathieu Raffinot},
title = {Practical combinations of repetition-aware data structures},
journal = {CoRR},
volume = {abs/1604.06002},
year = {2016},
url = {http://arxiv.org/abs/1604.06002},
eprinttype = {arXiv},
eprint = {1604.06002},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelazzouguiCGPR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BraquelaireGRU16,
author = {Tristan Braquelaire and
Marie Gasparoux and
Mathieu Raffinot and
Raluca Uricaru},
title = {A note on the shortest common superstring of {NGS} reads},
journal = {CoRR},
volume = {abs/1605.05542},
year = {2016},
url = {http://arxiv.org/abs/1605.05542},
eprinttype = {arXiv},
eprint = {1605.05542},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BraquelaireGRU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BelazzouguiKR16,
author = {Djamal Belazzougui and
Roman Kolpakov and
Mathieu Raffinot},
title = {Indexing and querying color sets of images},
journal = {CoRR},
volume = {abs/1608.07847},
year = {2016},
url = {http://arxiv.org/abs/1608.07847},
eprinttype = {arXiv},
eprint = {1608.07847},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelazzouguiKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BelazzouguiCGPR15,
author = {Djamal Belazzougui and
Fabio Cunial and
Travis Gagie and
Nicola Prezza and
Mathieu Raffinot},
editor = {Ferdinando Cicalese and
Ely Porat and
Ugo Vaccaro},
title = {Composite Repetition-Aware Data Structures},
booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015,
Ischia Island, Italy, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9133},
pages = {26--39},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19929-0\_3},
doi = {10.1007/978-3-319-19929-0\_3},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BelazzouguiCGPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BelazzouguiCGPR15,
author = {Djamal Belazzougui and
Fabio Cunial and
Travis Gagie and
Nicola Prezza and
Mathieu Raffinot},
title = {Composite repetition-aware data structures},
journal = {CoRR},
volume = {abs/1502.05937},
year = {2015},
url = {http://arxiv.org/abs/1502.05937},
eprinttype = {arXiv},
eprint = {1502.05937},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelazzouguiCGPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/OuangraouaR14,
author = {A{\"{\i}}da Ouangraoua and
Mathieu Raffinot},
title = {On the Identification of Conflicting Contiguities in Ancestral Genome
Reconstruction},
journal = {J. Comput. Biol.},
volume = {21},
number = {1},
pages = {64--79},
year = {2014},
url = {https://doi.org/10.1089/cmb.2013.0086},
doi = {10.1089/CMB.2013.0086},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/OuangraouaR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/MontgolfierRR14,
author = {Fabien de Montgolfier and
Mathieu Raffinot and
Irena Rusu},
title = {Easy Identification of Generalized Common and Conserved Nested Intervals},
journal = {J. Comput. Biol.},
volume = {21},
number = {7},
pages = {520--533},
year = {2014},
url = {https://doi.org/10.1089/cmb.2013.0146},
doi = {10.1089/CMB.2013.0146},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/MontgolfierRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BelazzouguiR13,
author = {Djamal Belazzougui and
Mathieu Raffinot},
title = {Approximate regular expression matching with multi-strings},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {14--21},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.07.008},
doi = {10.1016/J.JDA.2012.07.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BelazzouguiR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BelazzouguiKR13,
author = {Djamal Belazzougui and
Roman Kolpakov and
Mathieu Raffinot},
title = {Various improvements to text fingerprinting},
journal = {J. Discrete Algorithms},
volume = {22},
pages = {1--18},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.004},
doi = {10.1016/J.JDA.2013.06.004},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BelazzouguiKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BelazzouguiR13,
author = {Djamal Belazzougui and
Mathieu Raffinot},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Average Optimal String Matching in Packed Strings},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {37--48},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_4},
doi = {10.1007/978-3-642-38233-8\_4},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BelazzouguiR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BelazzouguiPRV13,
author = {Djamal Belazzougui and
Adeline Pierrot and
Mathieu Raffinot and
St{\'{e}}phane Vialette},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Single and Multiple Consecutive Permutation Motif Search},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {66--77},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_7},
doi = {10.1007/978-3-642-45030-3\_7},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BelazzouguiPRV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-3488,
author = {Djamal Belazzougui and
Roman Kolpakov and
Mathieu Raffinot},
title = {Various improvements to text fingerprinting},
journal = {CoRR},
volume = {abs/1301.3488},
year = {2013},
url = {http://arxiv.org/abs/1301.3488},
eprinttype = {arXiv},
eprint = {1301.3488},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-3488.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-4952,
author = {Djamal Belazzougui and
Adeline Pierrot and
Mathieu Raffinot and
St{\'{e}}phane Vialette},
title = {Single and multiple consecutive permutation motif search},
journal = {CoRR},
volume = {abs/1301.4952},
year = {2013},
url = {http://arxiv.org/abs/1301.4952},
eprinttype = {arXiv},
eprint = {1301.4952},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-4952.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-4747,
author = {Fabien de Montgolfier and
Mathieu Raffinot and
Irena Rusu},
title = {Easy identification of generalized common nested intervals},
journal = {CoRR},
volume = {abs/1305.4747},
year = {2013},
url = {http://arxiv.org/abs/1305.4747},
eprinttype = {arXiv},
eprint = {1305.4747},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-4747.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CharbitMR12,
author = {Pierre Charbit and
Fabien de Montgolfier and
Mathieu Raffinot},
title = {Linear Time Split Decomposition Revisited},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {2},
pages = {499--514},
year = {2012},
url = {https://doi.org/10.1137/10080052X},
doi = {10.1137/10080052X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CharbitMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/OuangraouaR12,
author = {A{\"{\i}}da Ouangraoua and
Mathieu Raffinot},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jens Stoye},
title = {Faster and Simpler Minimal Conflicting Set Identification - (Extended
Abstract)},
booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
Helsinki, Finland, July 3-5, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7354},
pages = {41--55},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31265-6\_4},
doi = {10.1007/978-3-642-31265-6\_4},
timestamp = {Tue, 21 Mar 2023 21:02:12 +0100},
biburl = {https://dblp.org/rec/conf/cpm/OuangraouaR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-5513,
author = {A{\"{\i}}da Ouangraoua and
Mathieu Raffinot},
title = {Faster and Simpler Minimal Conflicting Set Identification},
journal = {CoRR},
volume = {abs/1201.5513},
year = {2012},
url = {http://arxiv.org/abs/1201.5513},
eprinttype = {arXiv},
eprint = {1201.5513},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-5513.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Raffinot11,
author = {Mathieu Raffinot},
editor = {Benedikt L{\"{o}}we and
Dag Normann and
Ivan N. Soskov and
Alexandra A. Soskova},
title = {Consecutive Ones Property Testing: Cut or Swap},
booktitle = {Models of Computation in Context - 7th Conference on Computability
in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6735},
pages = {239--249},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21875-0\_25},
doi = {10.1007/978-3-642-21875-0\_25},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/Raffinot11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BelazzouguiR11,
author = {Djamal Belazzougui and
Mathieu Raffinot},
editor = {Roberto Grossi and
Fabrizio Sebastiani and
Fabrizio Silvestri},
title = {Approximate Regular Expression Matching with Multi-strings},
booktitle = {String Processing and Information Retrieval, 18th International Symposium,
{SPIRE} 2011, Pisa, Italy, October 17-21, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7024},
pages = {55--66},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-24583-1\_7},
doi = {10.1007/978-3-642-24583-1\_7},
timestamp = {Sun, 25 Oct 2020 23:17:26 +0100},
biburl = {https://dblp.org/rec/conf/spire/BelazzouguiR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-3786,
author = {Mathieu Raffinot},
title = {Consecutive ones property testing: cut or swap},
journal = {CoRR},
volume = {abs/1008.3786},
year = {2010},
url = {http://arxiv.org/abs/1008.3786},
eprinttype = {arXiv},
eprint = {1008.3786},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-3786.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-1700,
author = {Pierre Charbit and
Fabien de Montgolfier and
Mathieu Raffinot},
title = {A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs},
journal = {CoRR},
volume = {abs/0902.1700},
year = {2009},
url = {http://arxiv.org/abs/0902.1700},
eprinttype = {arXiv},
eprint = {0902.1700},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-1700.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CharbitHLMRR08,
author = {Pierre Charbit and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier and
Mathieu Raffinot and
Micha{\"{e}}l Rao},
title = {A note on computing set overlap classes},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {186--191},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.005},
doi = {10.1016/J.IPL.2008.05.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CharbitHLMRR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KolpakovR08,
author = {Roman Kolpakov and
Mathieu Raffinot},
title = {New algorithms for text fingerprinting},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {243--255},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.05.001},
doi = {10.1016/J.JDA.2007.05.001},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KolpakovR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BergeronCMR08,
author = {Anne Bergeron and
C{\'{e}}dric Chauve and
Fabien de Montgolfier and
Mathieu Raffinot},
title = {Computing Common Intervals of {K} Permutations, with Applications
to Modular Decomposition of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {3},
pages = {1022--1039},
year = {2008},
url = {https://doi.org/10.1137/060651331},
doi = {10.1137/060651331},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BergeronCMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/KolpakovR08,
author = {Roman Kolpakov and
Mathieu Raffinot},
editor = {Amihood Amir and
Andrew Turpin and
Alistair Moffat},
title = {Faster Text Fingerprinting},
booktitle = {String Processing and Information Retrieval, 15th International Symposium,
{SPIRE} 2008, Melbourne, Australia, November 10-12, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5280},
pages = {15--26},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-89097-3\_4},
doi = {10.1007/978-3-540-89097-3\_4},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/KolpakovR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-4573,
author = {Pierre Charbit and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier and
Mathieu Raffinot and
Micha{\"{e}}l Rao},
title = {A Note On Computing Set Overlap Classes},
journal = {CoRR},
volume = {abs/0711.4573},
year = {2007},
url = {http://arxiv.org/abs/0711.4573},
eprinttype = {arXiv},
eprint = {0711.4573},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-4573.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CoulonR06,
author = {Fabien Coulon and
Mathieu Raffinot},
title = {Fast algorithms for identifying maximal common connected sets of interval
graphs},
journal = {Discret. Appl. Math.},
volume = {154},
number = {12},
pages = {1709--1721},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2006.02.005},
doi = {10.1016/J.DAM.2006.02.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CoulonR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KolpakovR06,
author = {Roman Kolpakov and
Mathieu Raffinot},
editor = {Moshe Lewenstein and
Gabriel Valiente},
title = {New Algorithms for Text Fingerprinting},
booktitle = {Combinatorial Pattern Matching, 17th Annual Symposium, {CPM} 2006,
Barcelona, Spain, July 5-7, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4009},
pages = {342--353},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780441\_31},
doi = {10.1007/11780441\_31},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/KolpakovR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NavarroR04,
author = {Gonzalo Navarro and
Mathieu Raffinot},
title = {New Techniques for Regular Expression Searching},
journal = {Algorithmica},
volume = {41},
number = {2},
pages = {89--116},
year = {2005},
url = {https://doi.org/10.1007/s00453-004-1120-3},
doi = {10.1007/S00453-004-1120-3},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/NavarroR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/El-MabroukRDLL05,
author = {Nadia El{-}Mabrouk and
Mathieu Raffinot and
Jean{-}Eudes Duchesne and
Mathieu Lajoie and
Nicolas Luc},
title = {Approximate Matching of Structured Motifs in Dna Sequences},
journal = {J. Bioinform. Comput. Biol.},
volume = {3},
number = {2},
pages = {317--342},
year = {2005},
url = {https://doi.org/10.1142/S0219720005001065},
doi = {10.1142/S0219720005001065},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jbcb/El-MabroukRDLL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BergeronCMR05,
author = {Anne Bergeron and
C{\'{e}}dric Chauve and
Fabien de Montgolfier and
Mathieu Raffinot},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Computing Common Intervals of \emph{K} Permutations, with Applications
to Modular Decomposition of Graphs},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {779--790},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_69},
doi = {10.1007/11561071\_69},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/BergeronCMR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NavarroR04,
author = {Gonzalo Navarro and
Mathieu Raffinot},
title = {Practical and flexible pattern matching over Ziv-Lempel compressed
text},
journal = {J. Discrete Algorithms},
volume = {2},
number = {3},
pages = {347--371},
year = {2004},
url = {https://doi.org/10.1016/j.jda.2003.12.002},
doi = {10.1016/J.JDA.2003.12.002},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NavarroR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BealBCR04,
author = {Marie{-}Pierre B{\'{e}}al and
Anne Bergeron and
Sylvie Corteel and
Mathieu Raffinot},
title = {An algorithmic view of gene teams},
journal = {Theor. Comput. Sci.},
volume = {320},
number = {2-3},
pages = {395--418},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.02.036},
doi = {10.1016/J.TCS.2004.02.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BealBCR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/HabibPR04,
author = {Michel Habib and
Christophe Paul and
Mathieu Raffinot},
editor = {S{\"{u}}leyman Cenk Sahinalp and
S. Muthukrishnan and
Ugur Dogrus{\"{o}}z},
title = {Maximal Common Connected Sets of Interval Graphs},
booktitle = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004,
Istanbul,Turkey, July 5-7, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3109},
pages = {359--372},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27801-6\_27},
doi = {10.1007/978-3-540-27801-6\_27},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/HabibPR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candc/LucRBR03,
author = {Nicolas Luc and
Jean{-}Loup Risler and
Anne Bergeron and
Mathieu Raffinot},
title = {Gene teams: a new formalization of gene clusters for comparative genomics},
journal = {Comput. Biol. Chem.},
volume = {27},
number = {1},
pages = {59--67},
year = {2003},
url = {https://doi.org/10.1016/S1476-9271(02)00097-X},
doi = {10.1016/S1476-9271(02)00097-X},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/candc/LucRBR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/NavarroR03,
author = {Gonzalo Navarro and
Mathieu Raffinot},
title = {Fast and Simple Character Classes and Bounded Gaps Pattern Matching,
with Applications to Protein Searching},
journal = {J. Comput. Biol.},
volume = {10},
number = {6},
pages = {903--923},
year = {2003},
url = {https://doi.org/10.1089/106652703322756140},
doi = {10.1089/106652703322756140},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/NavarroR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0006497,
author = {Gonzalo Navarro and
Mathieu Raffinot},
title = {Flexible pattern matching in strings - practical on-line search algorithms
for texts and biological sequences},
publisher = {Cambridge University Press},
year = {2002},
url = {http://www.dcc.uchile.cl/\%7Egnavarro/FPMbook/},
doi = {10.1017/CBO9781316135228},
isbn = {978-0-521-81307-5},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0006497.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csb/DudoignonGHR02,
author = {Lorie Dudoignon and
Eric Gl{\'{e}}met and
Hendrik Cornelis Heus and
Mathieu Raffinot},
title = {High Similarity Sequence Comparison in Clustering Large Sequence Databases},
booktitle = {1st {IEEE} Computer Society Bioinformatics Conference, {CSB} 2002,
Stanford, CA, USA, August 14-16, 2002},
pages = {228--236},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CSB.2002.1039345},
doi = {10.1109/CSB.2002.1039345},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csb/DudoignonGHR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/El-MabroukR02,
author = {Nadia El{-}Mabrouk and
Mathieu Raffinot},
editor = {Gene Myers and
Sridhar Hannenhalli and
David Sankoff and
Sorin Istrail and
Pavel A. Pevzner and
Michael S. Waterman},
title = {Approximate matching of secondary structures},
booktitle = {Proceedings of the Sixth Annual International Conference on Computational
Biology, {RECOMB} 2002, Washington, DC, USA, April 18-21, 2002},
pages = {156--164},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/565196.565216},
doi = {10.1145/565196.565216},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/El-MabroukR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BergeronCR02,
author = {Anne Bergeron and
Sylvie Corteel and
Mathieu Raffinot},
editor = {Roderic Guig{\'{o}} and
Dan Gusfield},
title = {The Algorithmic of Gene Teams},
booktitle = {Algorithms in Bioinformatics, Second International Workshop, {WABI}
2002, Rome, Italy, September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2452},
pages = {464--476},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45784-4\_36},
doi = {10.1007/3-540-45784-4\_36},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/BergeronCR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Raffinot01,
author = {Mathieu Raffinot},
title = {On maximal repeats in strings},
journal = {Inf. Process. Lett.},
volume = {80},
number = {3},
pages = {165--169},
year = {2001},
url = {https://doi.org/10.1016/S0020-0190(01)00152-1},
doi = {10.1016/S0020-0190(01)00152-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Raffinot01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/AllauzenCR01,
author = {Cyril Allauzen and
Maxime Crochemore and
Mathieu Raffinot},
editor = {Amihood Amir and
Gad M. Landau},
title = {Efficient Experimental String Matching by Weak Factor Recognition},
booktitle = {Combinatorial Pattern Matching, 12th Annual Symposium, {CPM} 2001
Jerusalem, Israel, July 1-4, 2001 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2089},
pages = {51--72},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48194-X\_5},
doi = {10.1007/3-540-48194-X\_5},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/AllauzenCR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/NavarroR01,
author = {Gonzalo Navarro and
Mathieu Raffinot},
editor = {Thomas Lengauer},
title = {Fast and simple character classes and bounded gaps pattern matching,
with application to protein searching},
booktitle = {Proceedings of the Fifth Annual International Conference on Computational
Biology, {RECOMB} 2001, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
April 22-25, 2001},
pages = {231--240},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/369133.369220},
doi = {10.1145/369133.369220},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/recomb/NavarroR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/NavarroR01,
author = {Gonzalo Navarro and
Mathieu Raffinot},
editor = {Gerth St{\o}lting Brodal and
Daniele Frigioni and
Alberto Marchetti{-}Spaccamela},
title = {Compact {DFA} Representation for Fast Regular Expression Search},
booktitle = {Algorithm Engineering, 5th International Workshop, {WAE} 2001 Aarhus,
Denmark, August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2141},
pages = {1--12},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44688-5\_1},
doi = {10.1007/3-540-44688-5\_1},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wae/NavarroR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AllauzenR00,
author = {Cyril Allauzen and
Mathieu Raffinot},
title = {Simple Optimal String Matching Algorithm},
journal = {J. Algorithms},
volume = {36},
number = {1},
pages = {102--116},
year = {2000},
url = {https://doi.org/10.1006/jagm.2000.1087},
doi = {10.1006/JAGM.2000.1087},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AllauzenR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NavarroR00,
author = {Gonzalo Navarro and
Mathieu Raffinot},
title = {Fast and Flexible String Matching by Combining Bit-Parallelism and
Suffix Automata},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {4},
year = {2000},
url = {https://doi.org/10.1145/351827.384246},
doi = {10.1145/351827.384246},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/NavarroR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/AllauzenR00,
author = {Cyril Allauzen and
Mathieu Raffinot},
editor = {Raffaele Giancarlo and
David Sankoff},
title = {Simple Optimal String Matching Algorithm},
booktitle = {Combinatorial Pattern Matching, 11th Annual Symposium, {CPM} 2000,
Montreal, Canada, June 21-23, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1848},
pages = {364--374},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45123-4\_30},
doi = {10.1007/3-540-45123-4\_30},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/AllauzenR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Raffinot99,
author = {Mathieu Raffinot},
title = {Asymptotic Estimation of the Average Number of Terminal States in
DAWGs},
journal = {Discret. Appl. Math.},
volume = {92},
number = {2-3},
pages = {193--203},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00047-5},
doi = {10.1016/S0166-218X(99)00047-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Raffinot99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/NavarroR99,
author = {Gonzalo Navarro and
Mathieu Raffinot},
editor = {Maxime Crochemore and
Mike Paterson},
title = {A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed
Text},
booktitle = {Combinatorial Pattern Matching, 10th Annual Symposium, {CPM} 99, Warwick
University, UK, July 22-24, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1645},
pages = {14--36},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48452-3\_2},
doi = {10.1007/3-540-48452-3\_2},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/NavarroR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/AllauzenCR99,
author = {Cyril Allauzen and
Maxime Crochemore and
Mathieu Raffinot},
editor = {Jan Pavelka and
Gerard Tel and
Miroslav Bartosek},
title = {Factor Oracle: {A} New Structure for Pattern Matching},
booktitle = {{SOFSEM} '99, Theory and Practice of Informatics, 26th Conference
on Current Trends in Theory and Practice of Informatics, Milovy, Czech
Republic, November 27 - December 4, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1725},
pages = {295--310},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-47849-3\_18},
doi = {10.1007/3-540-47849-3\_18},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/AllauzenCR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/NavarroR99,
author = {Gonzalo Navarro and
Mathieu Raffinot},
editor = {Jeffrey Scott Vitter and
Christos D. Zaroliagis},
title = {Fast Regular Expression Search},
booktitle = {Algorithm Engineering, 3rd International Workshop, {WAE} '99, London,
UK, July 19-21, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1668},
pages = {198--212},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48318-7\_17},
doi = {10.1007/3-540-48318-7\_17},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wae/NavarroR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/NavarroR98,
author = {Gonzalo Navarro and
Mathieu Raffinot},
editor = {Martin Farach{-}Colton},
title = {A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching},
booktitle = {Combinatorial Pattern Matching, 9th Annual Symposium, {CPM} 98, Piscataway,
New Jersey, USA, July 20-22, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1448},
pages = {14--33},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0030778},
doi = {10.1007/BFB0030778},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/NavarroR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-02-29 20:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
