Eric Rivals

According to our database, Eric Rivals authored at least 64 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Incremental computation of the set of period sets.

Eric Rivals

CoRR, 2024

Counting overlapping pairs of strings.

Eric Rivals, Pengfei Wang

CoRR, 2024

2023

EPIK: precise and scalable evolutionary placement with informative <i>k</i>-mers.

Nikolai Romashchenko, Benjamin Linard, Fabio Pardi, Eric Rivals

Bioinform., December, 2023

Physical modeling of ribosomes along messenger RNA: Estimating kinetic parameters from ribosome profiling experiments using a ballistic model.

Carole Chevalier, Jérôme Dorignac, Yahaya Ibrahim, Armelle Choquet, Alexandre David, Julie Ripoll, Eric Rivals, Frédéric Geniet, Nils-Ole Walliser, John Palmeri, Andrea Parmeggiani, Jean-Charles Walter

PLoS Comput. Biol., October, 2023

dipwmsearch: a Python package for searching di-PWM motifs.

Marie Mille, Julie Ripoll, Bastien Cazaux, Eric Rivals

Bioinform., April, 2023

Computing Phylo-$k$k-Mers.

Nikolai Romashchenko, Benjamin Linard, Eric Rivals, Fabio Pardi

IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Periodicity of Degenerate Strings.

Estéban Gabory, Eric Rivals, Michelle Sweering, Hilde Verbeek, Pengfei Wang

Proceedings of the Prague Stringology Conference 2023, 2023

Convergence of the Number of Period Sets in Strings.

Eric Rivals, Michelle Sweering, Pengfei Wang

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2021

Rapid screening and detection of inter-type viral recombinants using phylo-k-mers.

Guillaume E. Scholz, Benjamin Linard, Nikolai Romashchenko, Eric Rivals, Fabio Pardi

Bioinform., 2021

PEWO: a collection of workflows to benchmark phylogenetic placement.

Benjamin Linard, Nikolai Romashchenko, Fabio Pardi, Eric Rivals

Bioinform., 2021

A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs.

Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Hierarchical Overlap Graph.

Bastien Cazaux, Eric Rivals

Inf. Process. Lett., 2020

Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring.

Bastien Cazaux, Eric Rivals

CoRR, 2020

Efficient Construction of Hierarchical Overlap Graphs.

Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals

Proceedings of the String Processing and Information Retrieval, 2020

2019

Linking indexing data structures to de Bruijn graphs: Construction and update.

Bastien Cazaux, Thierry Lecroq, Eric Rivals

J. Comput. Syst. Sci., 2019

AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees.

Bastien Cazaux, Guillaume Castel, Eric Rivals

Bioinform., 2019

Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding.

Bastien Cazaux, Eric Rivals

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Relationship between superstring and compression measures: New insights on the greedy conjecture.

Bastien Cazaux, Eric Rivals

Discret. Appl. Math., 2018

Strong link between BWT and XBW via Aho-Corasick automaton and applications to Run-Length Encoding.

Bastien Cazaux, Eric Rivals

CoRR, 2018

Practical lower and upper bounds for the Shortest Linear Superstring.

Bastien Cazaux, Samuel Juhel, Eric Rivals

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Superstrings with multiplicities.

Bastien Cazaux, Eric Rivals

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Fast and Accurate Genome-Scale Identification of DNA-Binding Sites.

David Martin, Vincent Maillol, Eric Rivals

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

2017

The Compressed Overlap Index.

Rodrigo Cánovas, Bastien Cazaux, Eric Rivals

CoRR, 2017

Accurate self-correction of errors in long reads using de Bruijn graphs.

Leena Salmela, Riku Walve, Eric Rivals, Esko Ukkonen

Bioinform., 2017

Rearrangement Scenarios Guided by Chromatin Structure.

Sylvain Pulicani, Pijus Simonaitis, Eric Rivals, Krister M. Swenson

Proceedings of the Comparative Genomics - 15th International Workshop, 2017

Full Compressed Affix Tree Representations.

Rodrigo Cánovas, Eric Rivals

Proceedings of the 2017 Data Compression Conference, 2017

2016

A linear time algorithm for Shortest Cyclic Cover of Strings.

Bastien Cazaux, Eric Rivals

J. Discrete Algorithms, 2016

The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings.

Bastien Cazaux, Eric Rivals

Discret. Appl. Math., 2016

Read mapping on de Bruijn graphs.

Antoine Limasset, Bastien Cazaux, Eric Rivals, Pierre Peterlongo

BMC Bioinform., 2016

Shortest DNA Cyclic Cover in Compressed Space.

Bastien Cazaux, Rodrigo Cánovas, Eric Rivals

Proceedings of the 2016 Data Compression Conference, 2016

Superstring Graph: A New Approach for Genome Assembly.

Bastien Cazaux, Gustavo Sacomoto, Eric Rivals

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

YOC, A new strategy for pairwise alignment of collinear genomes.

Raluca Uricaru, Célia Michotey, Hélène Chiapello, Eric Rivals

BMC Bioinform., 2015

Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree.

Bastien Cazaux, Thierry Lecroq, Eric Rivals

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Reverse engineering of compact suffix trees and links: A novel algorithm.

Bastien Cazaux, Eric Rivals

J. Discrete Algorithms, 2014

LoRDEC: accurate and efficient long read error correction.

Leena Salmela, Eric Rivals

Bioinform., 2014

Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings.

Bastien Cazaux, Eric Rivals

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

From Indexing Data Structures to de Bruijn Graphs.

Bastien Cazaux, Thierry Lecroq, Eric Rivals

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Scalable and Versatile <i>k</i>-mer Indexing for High-Throughput Sequencing Data.

Niko Välimäki, Eric Rivals

Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

2012

A Scalable Indexing Solution to Mine Huge Genomic Sequence Collections.

Eric Rivals, Nicolas Philippe, Mikaël Salson, Martine Léonard, Therese Commes, Thierry Lecroq

ERCIM News, 2012

2011

Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps.

Raluca Uricaru, Alban Mancheron, Eric Rivals

J. Comput. Biol., 2011

Querying large read collections in main memory: a versatile data structure.

Nicolas Philippe, Mikaël Salson, Thierry Lecroq, Martine Léonard, Therese Commes, Eric Rivals

BMC Bioinform., 2011

Approximate Common Intervals in Multiple Genome Comparison.

Annie Chateau, Pierre Riou, Eric Rivals

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

2010

Reliable Bacterial Genome Comparison Tools.

Eric Rivals, Alban Mancheron, Raluca Uricaru

ERCIM News, 2010

2009

mpscan: Fast Localisation of Multiple Reads in Genomes.

Eric Rivals, Leena Salmela, Petteri Kiiskinen, Petri Kalsi, Jorma Tarhio

Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

2008

Hardness of optimal spaced seed design.

François Nicolas, Eric Rivals

J. Comput. Syst. Sci., 2008

2007

Longest common subsequence problem for unoriented and cyclic strings.

François Nicolas, Eric Rivals

Theor. Comput. Sci., 2007

Detection of recombination in variable number tandem repeat sequences.

Ezekiel F. Adebiyi, Eric Rivals

South Afr. Comput. J., 2007

Detecting microsatellites within genomes: significant variation among algorithms.

Sébastien Leclercq, Eric Rivals, Philippe Jarne

BMC Bioinform., 2007

2006

Tiling an Interval of the Discrete Line.

Olivier Bodini, Eric Rivals

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005

Hardness results for the center and median string problems under the weighted and unweighted edit distances.

François Nicolas, Eric Rivals

J. Discrete Algorithms, 2005

2004

A Survey On Algorithmic Aspects Of Tandem Repeats Evolution.

Eric Rivals

Int. J. Found. Comput. Sci., 2004

STAR: an algorithm to Search for Tandem Approximate Repeats.

Olivier Delgrange, Eric Rivals

Bioinform., 2004

2003

Combinatorics of periods in strings.

Eric Rivals, Sven Rahmann

J. Comb. Theory A, 2003

Comparison of Minisatellites.

Sèverine Bérard, Eric Rivals

J. Comput. Biol., 2003

On The Distribution Of The Number Of Missing Words In Random Texts.

Sven Rahmann, Eric Rivals

Comb. Probab. Comput., 2003

Complexities of the Centre and Median String Problems.

François Nicolas, Eric Rivals

Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2000

Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts.

Sven Rahmann, Eric Rivals

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999

Transformation distances: a family of dissimilarity measures based on movements of segments.

Jean-Stéphane Varré, Jean-Paul Delahaye, Eric Rivals

Bioinform., 1999

<i>q</i>-gram based database searching using a suffix array (QUASAR).

Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-Peter Lenhof, Eric Rivals, Martin Vingron

Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

Location of Repetitive Regions in Sequences By Optimizing A Compression Method.

Olivier Delgrange, Max Dauchet, Eric Rivals

Proceedings of the 4th Pacific Symposium on Biocomputing, 1999

1998

Optimal Representation in Average Using Kolmogorov Complexity.

Eric Rivals, Jean-Paul Delahaye

Theor. Comput. Sci., 1998

The transformation distance: A dissimilarity measure based an movements of segments.

Jean-Stéphane Varré, Jean-Paul Delahaye, Eric Rivals

Proceedings of the German Conference on Bioinformatics, 1998

1997

Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences.

Eric Rivals, Olivier Delgrange, Jean-Paul Delahaye, Max Dauchet, Marie-Odile Delorme, Alain Hénaut, Emmanuelle Ollivier

Comput. Appl. Biosci., 1997

1996

A Guaranteed Compression Scheme for Repetitive DNA Sequences.

Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996