Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Grégory Ranchy

dblp:02/649 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
pattern matching		 0.112005
Suffix-tree analyser (STAN): looking for nucleotidic and peptidic patterns in chromosomes · Bioinform. 2005
Bioinformatics and computational biology
sequence analysis		 0.112005
Suffix-tree analyser (STAN): looking for nucleotidic and peptidic patterns in chromosomes · Bioinform. 2005

Methods — techniques the papers use, named apart from their topics

suffix tree · 0.1multipart matching · 0.1
YearPublicationVenuePosition
2005 Suffix-tree analyser (STAN): looking for nucleotidic and peptidic patterns in chromosomes
abstract
SUMMARY: We have developed STAN (suffix-tree analyser), a tool to search for nucleotidic and peptidic patterns within whole chromosomes. Pattern syntax uses a string variable grammar-like formalism which allows the description of complex patterns including ambiguities, insertions/deletions, gaps, repeats and palindromes. STAN is based on a reduction to multipart matching on a suffix-tree data structure and can handle large DNA sequences, whether assembled or not.
Jacques Nicolas, Patrick Durand, Grégory Ranchy, Sébastien Tempel, Anne-Sophie Valin
 Bioinform.3