David R. C. Hill
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
David R. C. Hill has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Alexandre Muzy
Fire Modelling & Simulation , University of Corsica , SPE - UMR CNRS 6134, B.P. 52, Campus Grossetti, 20250 Corti, France
2 shared publications Eric Innocenti
2 shared publications- Mohieddine Missaoui
UMR CNRS 6158, ISIMA/LIMOS, Clermont Université et Université Blaise Pascal, F63173 Aubière, France
2 shared publications - Pierre Peyret
Université Clermont Auvergne, INRAE, MEDIS, Clermont-Ferrand, France
2 shared publications Antoine Aïello
University of Corsica
1 shared publication- Antoine Mahul
Clermont Université, CRRI, F63177 Aubière, France
1 shared publication
Latest Publications
- Open Access
- 6 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-9
Large Scale Explorative Oligonucleotide Probe Selection for Thousands of Genetic Groups on a Computing Grid: Application to Phylogenetic Probe Design Using a Curated Small Subunit Ribosomal RNA Gene Database
Phylogenetic Oligonucleotide Arrays (POAs) were recently adapted for studying the huge microbial communities in a flexible and easy-to-use way. POA coupled with the use of explorative probes to detect the unknown part is now one of the most powerful approaches for a better understanding of microbial community functioning. However, the selection of probes remains a very difficult task. The rapid growth of environmental databases has led to an exponential increase of data to be managed for an efficient design. Consequently, the use of high performance computing facilities is mandatory. In this paper, we present an efficient parallelization method to select known and explorative oligonucleotide probes at large scale using computing grids. We implemented a software that generates and monitors thousands of jobs over the European Computing Grid Infrastructure (EGI). We also developed a new algorithm for the construction of a high-quality curated phylogenetic database to avoid erroneous design due to bad sequence affiliation. We present here the performance and statistics of our method on real biological datasets based on a phylogenetic prokaryotic database at the genus level and a complete design of about 20,000 probes for 2,069 genera of prokaryotes.
- 6 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-9
Open AccessLarge Scale Explorative Oligonucleotide Probe Selection for Thousands of Genetic Groups on a Computing Grid: Application to Phylogenetic Probe Design Using a Curated Small Subunit Ribosomal RNA Gene Database
Phylogenetic Oligonucleotide Arrays (POAs) were recently adapted for studying the huge microbial communities in a flexible and easy-to-use way. POA coupled with the use of explorative probes to detect the unknown part is now one of the most powerful approaches for a better understanding of microbial community functioning. However, the selection of probes remains a very difficult task. The rapid growth of environmental databases has led to an exponential increase of data to be managed for an efficient design. Consequently, the use of high performance computing facilities is mandatory. In this paper, we present an efficient parallelization method to select known and explorative oligonucleotide probes at large scale using computing grids. We implemented a software that generates and monitors thousands of jobs over the European Computing Grid Infrastructure (EGI). We also developed a new algorithm for the construction of a high-quality curated phylogenetic database to avoid erroneous design due to bad sequence affiliation. We present here the performance and statistics of our method on real biological datasets based on a phylogenetic prokaryotic database at the genus level and a complete design of about 20,000 probes for 2,069 genera of prokaryotes.
- 1 January 2008
- Published by European Alliance for Innovation n.o.
A post-processed 3D visualization tool for forest fire simulations
- 1 January 2008
- Published by European Alliance for Innovation n.o.
A post-processed 3D visualization tool for forest fire simulations
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1275-1279
Complete Backtranslation of Oligopeptides for Metabolic Pathways Exploration of Complex Environments using Functional Microarrays
When studying complex environments where the composing microorganisms are unknown, exploratory tools able to tackle with the biological diversity have to be proposed. DNA microarrays can be a good answer if we are in a position to propose all the probes that could target a specific enzyme. In addition, in the context of new metabolic pathways discovery, it appears that a full backtranslation of oligopeptides is also a promising approach. In both contexts it is preferable to have all the complete nucleic sequences corresponding to an enzyme of interest. In this paper, we revisit existing bioinformatics applications, which bring partial reverse translation solutions, and we propose an algorithm based on input oligopeptide degeneracy able to efficiently compute a complete backtranslation of oligopeptides. This algorithm is precious for the discovery of new organisms and we show its performance on simulated and real biological datasets.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1275-1279
Complete Backtranslation of Oligopeptides for Metabolic Pathways Exploration of Complex Environments using Functional Microarrays
When studying complex environments where the composing microorganisms are unknown, exploratory tools able to tackle with the biological diversity have to be proposed. DNA microarrays can be a good answer if we are in a position to propose all the probes that could target a specific enzyme. In addition, in the context of new metabolic pathways discovery, it appears that a full backtranslation of oligopeptides is also a promising approach. In both contexts it is preferable to have all the complete nucleic sequences corresponding to an enzyme of interest. In this paper, we revisit existing bioinformatics applications, which bring partial reverse translation solutions, and we propose an algorithm based on input oligopeptide degeneracy able to efficiently compute a complete backtranslation of oligopeptides. This algorithm is precious for the discovery of new organisms and we show its performance on simulated and real biological datasets.
- 5 May 2006
- Published by Springer Nature
- p. 247-254
DYNAMIC STRUCTURE CELLULAR AUTOMATA IN A FIRE SPREADING APPLICATION
- 5 May 2006
- Published by Springer Nature
- p. 247-254
DYNAMIC STRUCTURE CELLULAR AUTOMATA IN A FIRE SPREADING APPLICATION