Hélène Touzet

Orcid: 0000-0001-5305-9987

Affiliations:
  • LIFL Lille, France


According to our database1, Hélène Touzet authored at least 36 papers between 1996 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Comparative assessment of long-read error correction software applied to Nanopore RNA-sequencing data.
Briefings Bioinform., 2020

2018
DiNAMO: highly sensitive DNA motif discovery in high-throughput sequencing data.
BMC Bioinform., 2018

MATAM: reconstruction of phylogenetic marker genes from short sequencing reads in metagenomes.
Bioinform., 2018

2017
Efficient approximations of RNA kinetics landscape using non-redundant sampling.
Bioinform., 2017

2016
Approximate search of short patterns with high error rates using the 01<sup>⁎</sup>0 lossless seeds.
J. Discrete Algorithms, 2016

On the Levenshtein Automaton and the Size of the Neighbourhood of a Word.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
Modeling Alternate RNA Structures in Genomic Sequences.
J. Comput. Biol., 2015

2014
Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems.
Algorithms, 2014

Lossless Seeds for Searching Short Patterns with High Error Rates.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Searching for alternate RNA structures in genomic sequences.
Proceedings of the 1st Workshop on Computational Methods for Structural RNAs (CMSR 2014), 2014

2012
RNA Locally Optimal Secondary Structures.
J. Comput. Biol., 2012

SortMeRNA: fast and accurate filtering of ribosomal RNAs in metatranscriptomic data.
Bioinform., 2012

BRASERO: A Resource for Benchmarking RNA Secondary Structure Comparison Algorithms.
Adv. Bioinformatics, 2012

2010
Alignments of RNA Structures.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

TFM-Explorer: mining <i>cis</i>-regulatory regions in genomes.
Nucleic Acids Res., 2010

2009
Computational identification of protein-coding sequences by comparative analysis.
Int. J. Data Min. Bioinform., 2009

Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching.
Proceedings of the Language and Automata Theory and Applications, 2009

2008
MAGNOLIA: multiple alignment of protein-coding and structural RNA sequences.
Nucleic Acids Res., 2008

2007
Comparing similar ordered trees in linear-time.
J. Discrete Algorithms, 2007

Efficient and accurate P-value computation for Position Weight Matrices.
Algorithms Mol. Biol., 2007

2006
Predicting transcription factor binding sites using local over-representation and comparative genomics.
BMC Bioinform., 2006

How to Compare Arc-Annotated Sequences: The Alignment Hierarchy.
Proceedings of the String Processing and Information Retrieval, 2006

Large Scale Matching for Position Weight Matrices.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Decomposition algorithms for the tree edit distance problem.
J. Discrete Algorithms, 2005

A Linear Tree Edit Distance Algorithm for Similar Ordered Trees.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
CARNAC: folding families of related RNAs.
Nucleic Acids Res., 2004

2003
Tree edit distance with gaps.
Inf. Process. Lett., 2003

Finding the common structure shared by two homologous RNAs.
Bioinform., 2003

Analysis of Tree Edit Distance Algorithms.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
A Characterisation of Multiply Recursive Functions with Higman's Lemma.
Inf. Comput., 2002

2001
Algorithms with polynomial interpretation termination proof.
J. Funct. Program., 2001

1998
Encoding the Hydra Battle as a Rewrite System.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

A Complex Example of a Simplifying Rewrite System.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Complexity Classes and Rewrite Systems with Polynomial Interpretation.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997
Propriétés combinatoires pour la terminaison de systèmes de réécriture. (Combinatorial properties for termination in term rewriting theory).
PhD thesis, 1997

1996
An Ordinal Calculus for Proving Termination in Term Rewriting.
Proceedings of the Trees in Algebra and Programming, 1996


  Loading...