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

Nicolas Parisot

dblp:122/2348 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2012
0000-0001-5217-8415ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 1 · 1 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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › synthetic biology
oligonucleotide design
0.112012
KASpOD - a web service for highly specific and explorative oligonucleotide design · Bioinform. 2012
Bioinformatics and computational biology
sequence analysis
0.112012
KASpOD - a web service for highly specific and explorative oligonucleotide design · Bioinform. 2012
Bioinformatics and computational biology
phylogenetics
0.012012
KASpOD - a web service for highly specific and explorative oligonucleotide design · Bioinform. 2012

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

k-mer-based algorithm · 0.1
YearPublicationVenuePosition
2012 MetaExploArrays: A Large-Scale Oligonucleotide Probe Design Software for Explorative DNA Microarrays
abstract
The selection of oligonucleotide probes for micro arrays is still very difficult task. With the rapid growth of environmental databases (metagenomics programs coupled to next generation sequencing), the computational capacity requirements of probe design algorithms have hugely increased. The use of parallel and distributed architectures can considerably reduce the complexity and the computational time of these algorithms. In this paper we present a new efficient algorithm of oligonucleotide probe selection for an individual specific nucleic acid sequence or a group of sequences. We used a model driven engineering approach to simultaneous design of thousands of sensitive, specific, isothermal and explorative probes, on both PC, multiprocessor, cluster and grid computing with on the one hand a significant computing speedup and on the other hand an improved quality of the resulting probes when compared to equivalent software.
Faouzi Jaziri, David R. C. Hill, Nicolas Parisot, Jérémie Denonfoux, Eric Dugat-Bony, Eric Peyretaillade, Pierre Peyret
PDCAT3
2012 KASpOD - a web service for highly specific and explorative oligonucleotide design
abstract
SUMMARY: KASpOD is a web service dedicated to the design of signature sequences using a k-mer-based algorithm. Such highly specific and explorative oligonucleotides are then suitable for various goals, including Phylogenetic Oligonucleotide Arrays. AVAILABILITY: http://g2im.u-clermont1.fr/kaspod. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Nicolas Parisot, Jérémie Denonfoux, Eric Dugat-Bony, Pierre Peyret, Eric Peyretaillade
Bioinform.1