Laurent Mouchard

J. Discrete Algorithms, 2015

Parallelising the Computation of Minimal Absent Words.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2015

2014

Extending alignments with k-mismatches and ℓ-gaps.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Dealing with uncertainty and imprecision in image segmentation using belief function theory.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2014

Linear-time computation of minimal absent words using suffix array.

[BibT_eX]

[DOI]

BMC Bioinform., 2014

2013

Querying highly similar sequences.

[BibT_eX]

[DOI]

Int. J. Comput. Biol. Drug Des., 2013

Suffix Array of Alignment: A Practical Index for Similar Data.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

Suffix Tree of Alignment: An Efficient Index for Similar Data.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

Editorial.

[BibT_eX]

[DOI]

Simon J. Puglisi

J. Discrete Algorithms, 2012

On the number of elements to reorder when updating a suffix array.

[BibT_eX]

[DOI]

Mikaël Salson

J. Discrete Algorithms, 2012

An algorithm for mapping short reads to a dynamically changing genomic sequence.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Segmentation of Biological Target Volumes on Multi-tracer PET Images Based on Information Fusion for Achieving Dose Painting in Radiotherapy.

[BibT_eX]

[DOI]

Proceedings of the Medical Image Computing and Computer-Assisted Intervention - MICCAI 2012, 2012

Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Applications and Innovations, 2012

Lyndon fountains and the Burrows-Wheeler transform.

[BibT_eX]

[DOI]

Proceedings of the CUBE International IT Conference & Exhibition, 2012

Using Belief Function Theory to Deal with Uncertainties and Imprecisions in Image Processing.

[BibT_eX]

[DOI]

Proceedings of the Belief Functions: Theory and Applications, 2012

2010

Dynamic extended suffix arrays.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

REAL: an efficient REad ALigner for next generation sequencing reads.

[BibT_eX]

[DOI]

Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 2010

2009

A four-stage algorithm for updating a Burrows-Wheeler transform.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Algorithms for mapping short degenerate and weighted sequences to a reference genome.

[BibT_eX]

[DOI]

Int. J. Comput. Biol. Drug Des., 2009

A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies.

[BibT_eX]

[DOI]

Solon P. Pissis

Proceedings of the Parallel Computing: From Multicores and GPU's to Petascale, 2009

Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conferences on Bioinformatics, 2009

2008

A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching.

[BibT_eX]

[DOI]

Mohammad Sohel Rahman

Math. Comput. Sci., 2008

Dynamic Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

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

2007

Combinatorial Pattern Matching.

[BibT_eX]

[DOI]

Kunsoo Park

J. Discrete Algorithms, 2007

Pattern Matching in Degenerate DNA/RNA Sequences.

[BibT_eX]

M. Sohel Rahman

Proceedings of the Workshop on Algorithms and Computation 2007, 2007

2006

Computation of Repetitions and Regularities of Biologically Weighted Sequences.

[BibT_eX]

[DOI]

Manolis Christodoulakis

Katerina Perdikuri

Kostas Tsichlas

J. Comput. Biol., 2006

2005

Computing the Repetitions in a Biological Weighted Sequence.

[BibT_eX]

[DOI]

Katerina Perdikuri

J. Autom. Lang. Comb., 2005

A Linear Algorithm for the Detection of Evolutive Tandem Repeats.

[BibT_eX]

[DOI]

Richard Groult

J. Autom. Lang. Comb., 2005

2004

Speeding up the detection of evolutive tandem repeats.

[BibT_eX]

[DOI]

Richard Groult

Theor. Comput. Sci., 2004

2003

String Regularities with Don't Cares.

[BibT_eX]

Nord. J. Comput., 2003

Computing the Repetitions in a Weighted Sequence.

[BibT_eX]

[DOI]

Katerina Perdikuri

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

2002

Algorithms for Computing Approximate Repetitions in Musical Sequences.

[BibT_eX]

[DOI]

Emilios Cambouropoulos

Int. J. Comput. Math., 2002

Evolutive Tandem Repeats Using Hamming Distance.

[BibT_eX]

[DOI]

Richard Groult

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

Distributed Pattern Matching Using Finite Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2001

The Max-Shift Algorithm for Approximate String Matching.

[BibT_eX]

[DOI]

Yoan J. Pinzón

Proceedings of the Algorithm Engineering, 2001

Genome and Stringology.

[BibT_eX]

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

2000

Normal forms of quasiperiodic strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Computing Approximate Repetitions in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Club Workshop 2000, Prague, Czech Republic, 2000

Periods and Quasiperiods Characterization.

[BibT_eX]

[DOI]

Mireille Régnier

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

1999

Quasiperiodicity and String Covering.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Quasiperiodicity: From Detection to Normal Forms.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1999

Sequences Obtained from a Series of Permutations of Borders and Ultimately Periodic Words.

[BibT_eX]

[DOI]

Jean-Pierre Duval