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

C. Chevalet

dblp:81/2006 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author

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
2 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › statistical genetics
gene mapping
0.011997
Regional assignment of genetic markers using a somatic cell hybrid panel: a WWW interactive program available for the pig genome · Comput. Appl. Biosci. 1997
Bioinformatics and computational biology
statistical genetics
0.011997
Regional assignment of genetic markers using a somatic cell hybrid panel: a WWW interactive program available for the pig genome · Comput. Appl. Biosci. 1997
Bioinformatics and computational biology › RNA biology › RNA analysis › RNA bioinformatics
RNA secondary structure comparison
0.011992
An algorithm for comparing RNA secondary structures and searching for similar substructures · Comput. Appl. Biosci. 1992
Bioinformatics and computational biology › RNA biology › RNA analysis › RNA bioinformatics
RNA structure analysis
0.011992
An algorithm for comparing RNA secondary structures and searching for similar substructures · Comput. Appl. Biosci. 1992
Algorithms and data structures › sequence algorithms › string algorithms
tree edit distance
0.011992
An algorithm for comparing RNA secondary structures and searching for similar substructures · Comput. Appl. Biosci. 1992

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

tree edit algorithm · 0.0likelihood calculation · 0.0hierarchical clustering · 0.0bayes' theorem · 0.0
YearPublicationVenuePosition
1997 Regional assignment of genetic markers using a somatic cell hybrid panel: a WWW interactive program available for the pig genome
abstract
Motivation: Quick and easy gene mapping by the use of a panel of cytogenetically characterized somatic cell hybrids is possible, even if some discordant experimental results arise. Results: An interactive program is proposed and is made available on a WWW site to users of a somatic cell hybrid panel. Assignments to chromosomes and subchromosomal regions are based on likelihood calculations and Bayes' theorem, and a confidence level is provided. The method is illustrated in the case of the pig genome. Availability: The program can be accessed free of charge at URL http:/ /www. toulouse. inra.fr/lgc/lgc.html. Contact: E-mail: [email protected]
C. Chevalet, Jérôme Gouzy, M. SanCristobal-Gaudy
Comput. Appl. Biosci.1
1992 An algorithm for comparing RNA secondary structures and searching for similar substructures
abstract
To access the functional informations carried by RNA molecules at the level of their secondary structure interactions, we propose a comparison method based on a tree edit algorithm which takes into account the tree structure of RNA foldings. Any secondary structure is translated into a tree involving all its elementary substructures; then a shorter condensed tree is built in which any unbranched helix interspersed with bulges and interior loops is taken as a single node. This method includes several parameters: a comparison matrix between structural units, gap penalties, and the scoring between nodes of the condensed trees. Their effects have been analysed using as a model a rapidly divergent domain of the large ribosomal RNA, for which structural variation during evolution is well known. This method allows one to recognize precisely, in large target molecules, definite substructures that present with the query molecules only a limited set of closely related secondary structure features; it is still efficient if intervening features, which can correspond to insertion/deletion of entire stem regions, separate such structural elements. When coupled with a hierarchical clustering algorithm, this method is suitable for classifying RNA molecules according to their secondary structure homologies.
C. Chevalet, B. Michot
Comput. Appl. Biosci.1