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.

Thomas Junier

dblp:69/3559 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2010
0000-0002-4015-5969ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 3 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
3 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
phylogenetics
0.112010
The Newick utilities: high-throughput phylogenetic tree processing in the UNIX shell · Bioinform. 2010
Bioinformatics and computational biology › molecular evolution
recombination breakpoint detection
0.112010
The Newick utilities: high-throughput phylogenetic tree processing in the UNIX shell · Bioinform. 2010
Bioinformatics and computational biology › sequence analysis
sequence motif analysis
0.012001
mmsearch: a motif arrangement language and search program · Bioinform. 2001
Bioinformatics and computational biology › sequence analysis
sequence comparison
0.012000
Dotlet: diagonal plots in a Web browser · Bioinform. 2000
YearPublicationVenuePosition
2010 The Newick utilities: high-throughput phylogenetic tree processing in the UNIX shell
abstract
SUMMARY: We present a suite of Unix shell programs for processing any number of phylogenetic trees of any size. They perform frequently-used tree operations without requiring user interaction. They also allow tree drawing as scalable vector graphics (SVG), suitable for high-quality presentations and further editing, and as ASCII graphics for command-line inspection. As an example we include an implementation of bootscanning, a procedure for finding recombination breakpoints in viral genomes. AVAILABILITY: C source code, Python bindings and executables for various platforms are available from http://cegg.unige.ch/newick_utils. The distribution includes a manual and example data. The package is distributed under the BSD License. CONTACT: [email protected]
Thomas Junier, Evgeny M. Zdobnov
Bioinform.1
2001 mmsearch: a motif arrangement language and search program
abstract
UNLABELLED: This paper presents a language for describing arrangements of motifs in biological sequences, and a program that uses the language to find the arrangements in motif match databases. The program does not by itself search for the constituent motifs, and is thus independent of how they are detected, which allows it to use motif match data of various origins. AVAILABILITY: The program can be tested online at http://hits.isb-sib.ch and the distribution is available from ftp://ftp.isrec.isb-sib.ch/pub/software/unix/mmsearch-1.0.tar.gz CONTACT: [email protected] SUPPLEMENTARY INFORMATION: The full documentation about mmsearchis available from http://hits.isb-sib.ch/~tjunier/mmsearch/doc.
Thomas Junier, Marco Pagni, Philipp Bucher
Bioinform.1
2000 Dotlet: diagonal plots in a Web browser
abstract
UNLABELLED: Dotlet is a program for comparing sequences by the diagonal plot method. It is designed to be platform-independent and to run in a Web browser, thus enabling the majority of researchers to use it. AVAILABILITY: The applet can be tested at http://www.isrec.isb-sib.ch/java/dotlet/ Dotlet.html, and the source code is available upon request. CONTACT: Thomas. Junier Marco.Pagni @isrec.unil.ch SUPPLEMENTARY: The full documentation about d o t l e t is available from the above URL.
Thomas Junier, Marco Pagni
Bioinform.1