default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHélène Touzet
Person information
- affiliation: LIFL Lille, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[e2]Thierry Lecroq
, Hélène Touzet:
String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings. Lecture Notes in Computer Science 12944, Springer 2021, ISBN 978-3-030-86691-4 [contents]- 2020
- [j23]Leandro Lima, Camille Marchet, Ségolène Caboche, Corinne Da Silva, Benjamin Istace, Jean-Marc Aury, Hélène Touzet, Rayan Chikhi:
Comparative assessment of long-read error correction software applied to Nanopore RNA-sequencing data. Briefings Bioinform. 21(4): 1164-1181 (2020)
2010 – 2019
- 2018
- [j22]Pierre Pericard, Yoann Dufresne, Loïc Couderc, Samuel Blanquart, Hélène Touzet:
MATAM: reconstruction of phylogenetic marker genes from short sequencing reads in metagenomes. Bioinform. 34(4): 585-591 (2018) - [j21]Chadi Saad, Laurent Noé, Hugues Richard, Julie Leclerc, Marie-Pierre Buisine, Hélène Touzet, Martin Figeac:
DiNAMO: highly sensitive DNA motif discovery in high-throughput sequencing data. BMC Bioinform. 19(1): 223:1-223:10 (2018) - 2017
- [j20]Juraj Michalik, Hélène Touzet, Yann Ponty:
Efficient approximations of RNA kinetics landscape using non-redundant sampling. Bioinform. 33(14): i283-i292 (2017) - 2016
- [j19]Christophe Vroland, Mikaël Salson, Sébastien Bini, Hélène Touzet:
Approximate search of short patterns with high error rates using the 01⁎0 lossless seeds. J. Discrete Algorithms 37: 3-16 (2016) - [c14]Hélène Touzet:
On the Levenshtein Automaton and the Size of the Neighbourhood of a Word. LATA 2016: 207-218 - 2015
- [j18]Azadeh Saffarian, Mathieu Giraud, Hélène Touzet:
Modeling Alternate RNA Structures in Genomic Sequences. J. Comput. Biol. 22(3): 190-204 (2015) - [e1]Mihai Pop, Hélène Touzet:
Algorithms in Bioinformatics - 15th International Workshop, WABI 2015, Atlanta, GA, USA, September 10-12, 2015, Proceedings. Lecture Notes in Computer Science 9289, Springer 2015, ISBN 978-3-662-48220-9 [contents] - 2014
- [j17]Robert Giegerich, Hélène Touzet:
Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems. Algorithms 7(1): 62-144 (2014) - [c13]Azadeh Saffarian, Mathieu Giraud, Hélène Touzet:
Searching for alternate RNA structures in genomic sequences. CMSR@ECCB 2014: 13-24 - [c12]Christophe Vroland, Mikaël Salson, Hélène Touzet:
Lossless Seeds for Searching Short Patterns with High Error Rates. IWOCA 2014: 364-375 - 2012
- [j16]Julien Allali, Cédric Saule, Cédric Chauve, Yves D'Aubenton-Carafa, Alain Denise, Christine Drevet, Pascal Ferraro, Daniel Gautheret, Claire Herrbach, Fabrice Leclerc, Antoine de Monte, Aïda Ouangraoua, Marie-France Sagot, Michel Termier, Claude Thermes, Hélène Touzet:
BRASERO: A Resource for Benchmarking RNA Secondary Structure Comparison Algorithms. Adv. Bioinformatics 2012: 893048:1-893048:5 (2012) - [j15]Evguenia Kopylova, Laurent Noé, Hélène Touzet:
SortMeRNA: fast and accurate filtering of ribosomal RNAs in metatranscriptomic data. Bioinform. 28(24): 3211-3217 (2012) - [j14]Azadeh Saffarian, Mathieu Giraud, Antoine de Monte, Hélène Touzet:
RNA Locally Optimal Secondary Structures. J. Comput. Biol. 19(10): 1120-1133 (2012) - 2010
- [j13]Laurie Tonon, Hélène Touzet, Jean-Stéphane Varré:
TFM-Explorer: mining cis-regulatory regions in genomes. Nucleic Acids Res. 38(Web-Server-Issue): 286-292 (2010) - [j12]Guillaume Blin, Alain Denise, Serge Dulucq, Claire Herrbach, Hélène Touzet:
Alignments of RNA Structures. IEEE ACM Trans. Comput. Biol. Bioinform. 7(2): 309-322 (2010)
2000 – 2009
- 2009
- [j11]Arnaud Fontaine, Hélène Touzet:
Computational identification of protein-coding sequences by comparative analysis. Int. J. Data Min. Bioinform. 3(2): 160-176 (2009) - [c11]Aude Liefooghe, Hélène Touzet, Jean-Stéphane Varré:
Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching. LATA 2009: 481-492 - 2008
- [j10]Arnaud Fontaine, Antoine de Monte, Hélène Touzet:
MAGNOLIA: multiple alignment of protein-coding and structural RNA sequences. Nucleic Acids Res. 36(Web-Server-Issue): 14-18 (2008) - 2007
- [j9]Hélène Touzet, Jean-Stéphane Varré:
Efficient and accurate P-value computation for Position Weight Matrices. Algorithms Mol. Biol. 2 (2007) - [j8]Hélène Touzet:
Comparing similar ordered trees in linear-time. J. Discrete Algorithms 5(4): 696-705 (2007) - [c10]Arnaud Fontaine, Hélène Touzet:
Computational Identification of Protein-Coding Sequences by Comparative Analysis. BIBM 2007: 95-102 - 2006
- [j7]Matthieu Defrance, Hélène Touzet:
Predicting transcription factor binding sites using local over-representation and comparative genomics. BMC Bioinform. 7: 396 (2006) - [c9]Aude Liefooghe, Hélène Touzet, Jean-Stéphane Varré:
Large Scale Matching for Position Weight Matrices. CPM 2006: 401-412 - [c8]Guillaume Blin, Hélène Touzet:
How to Compare Arc-Annotated Sequences: The Alignment Hierarchy. SPIRE 2006: 291-303 - 2005
- [j6]Serge Dulucq, Hélène Touzet:
Decomposition algorithms for the tree edit distance problem. J. Discrete Algorithms 3(2-4): 448-471 (2005) - [c7]Hélène Touzet:
A Linear Tree Edit Distance Algorithm for Similar Ordered Trees. CPM 2005: 334-345 - 2004
- [j5]Hélène Touzet, Olivier Perriquet:
CARNAC: folding families of related RNAs. Nucleic Acids Res. 32(Web-Server-Issue): 142-145 (2004) - 2003
- [j4]Olivier Perriquet, Hélène Touzet, Max Dauchet:
Finding the common structure shared by two homologous RNAs. Bioinform. 19(1): 108-116 (2003) - [j3]Hélène Touzet:
Tree edit distance with gaps. Inf. Process. Lett. 85(3): 123-129 (2003) - [c6]Serge Dulucq, Hélène Touzet:
Analysis of Tree Edit Distance Algorithms. CPM 2003: 83-95 - 2002
- [j2]Hélène Touzet:
A Characterisation of Multiply Recursive Functions with Higman's Lemma. Inf. Comput. 178(2): 534-544 (2002) - 2001
- [j1]Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet:
Algorithms with polynomial interpretation termination proof. J. Funct. Program. 11(1): 33-53 (2001)
1990 – 1999
- 1999
- [c5]Hélène Touzet:
A Characterisation of Multiply Recursive Functions with Higman's Lemma. RTA 1999: 163-174 - 1998
- [c4]Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet:
Complexity Classes and Rewrite Systems with Polynomial Interpretation. CSL 1998: 372-384 - [c3]Hélène Touzet:
A Complex Example of a Simplifying Rewrite System. ICALP 1998: 507-517 - [c2]Hélène Touzet:
Encoding the Hydra Battle as a Rewrite System. MFCS 1998: 267-276 - 1997
- [b1]Hélène Touzet:
Propriétés combinatoires pour la terminaison de systèmes de réécriture. (Combinatorial properties for termination in term rewriting theory). Henri Poincaré University, Nancy, France, 1997 - 1996
- [c1]E. A. Cichon, Hélène Touzet:
An Ordinal Calculus for Proving Termination in Term Rewriting. CAAP 1996: 226-240
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST 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:
