Author
Thomas Huber
Other affiliations: Cooperative Research Centre, University of Queensland, University of New South Wales ...read more
Bio: Thomas Huber is an academic researcher from Australian National University. The author has contributed to research in topics: Physics & Nuclear magnetic resonance spectroscopy. The author has an hindex of 47, co-authored 159 publications receiving 17918 citations. Previous affiliations of Thomas Huber include Cooperative Research Centre & University of Queensland.
Papers published on a yearly basis
Papers
More filters
TL;DR: A 16S rRNA gene database (http://greengenes.lbl.gov) was used to provide chimera screening, standard alignment, and taxonomic classification using multiple published taxonomies as mentioned in this paper.
Abstract: A 16S rRNA gene database (http://greengenes.lbl.gov) addresses limitations of public repositories by providing chimera screening, standard alignment, and taxonomic classification using multiple published taxonomies. It was found that there is incongruent taxonomic nomenclature among curators even at the phylum level. Putative chimeras were identified in 3% of environmental sequences and in 0.2% of records derived from isolates. Environmental sequences were classified into 100 phylum-level lineages in the Archaea and Bacteria.
9,593 citations
TL;DR: Bellerophon was specifically developed to detect 16S rRNA gene chimeras in PCR-clone libraries of environmental samples but can be applied to other nucleotide sequence alignments.
Abstract: Summary: Bellerophon is a program for detecting chimeric sequences in multiple sequence datasets by an adaption of partial treeing analysis. Bellerophon was specifically developed to detect 16S rRNA gene chimeras in PCR-clone libraries of environmental samples but can be applied to other nucleotide sequence alignments.
Availability: Bellerophon is available as an interactive web server at http://foo.maths.uq.edu.au/~huber/bellerophon.pl
1,595 citations
TL;DR: The newest version of the GROningen MOlecular Simulation program package, GROMOS96, has been developed for the dynamic modelling of (bio)molecules using the methods of molecular dynamics, stochastic dynamics, and energy minimization as well as the path-integral formalism.
Abstract: We present the newest version of the GROningen MOlecular Simulation program package, GROMOS96. GROMOS96 has been developed for the dynamic modelling of (bio)molecules using the methods of molecular dynamics, stochastic dynamics, and energy minimization as well as the path-integral formalism. An overview of its functionality is given, highlighting methodology not present in the last major release, GROMOS87. The organization of the code is outlined, and reliability, testing, and efficiency issues involved in the design of this large (73 000 lines of FORTRAN77 code) and complex package are discussed. Finally, we present two applications illustrating new functionality: local elevation simulation and molecular dynamics in four spatial dimensions.
1,290 citations
Journal Article•
TL;DR: The GROningen MOlecular Simulation (GROMOS) program package as mentioned in this paper has been developed for the dynamic modeling of (bio)molecules using the methods of molecular dynamics, stochastic dynamics, and energy minimization as well as the path-integral formalism.
Abstract: We present the newest version of the GROningen MOlecular Simulation program package, GROMOS96. GROMOS96 has been developed for the dynamic modelling of (bio)molecules using the methods of molecular dynamics, stochastic dynamics, and energy minimization as well as the path-integral formalism. An overview of its functionality is given, highlighting methodology not present in the last major release, GROMOS87. The organization of the code is outlined, and reliability, testing, and efficiency issues involved in the design of this large (73 000 lines of FORTRAN77 code) and complex package are discussed. Finally, we present two applications illustrating new functionality: local elevation simulation and molecular dynamics in four spatial dimensions.
1,209 citations
TL;DR: Although the concept of memory has been introduced into a molecular dynamics algorithm, it can only be applied to systems with a small number of degrees of freedom, and offers the chance to generate a multitude of different low-energy structures, where other methods only give a single one or few.
Abstract: The concept of memory has been introduced into a molecular dynamics algorithm. This was done so as to persuade a molecular system to visit new areas of conformational space rather than be confined to a small number of low-energy regions. The method is demonstrated on a simple model system and the 11-residue cyclic peptide cyclosporin A. For comparison, calculations were also performed using simulated temperature annealing and a potential energy annealing scheme. Although the method can only be applied to systems with a small number of degrees of freedom, it offers the chance to generate a multitude of different low-energy structures, where other methods only give a single one or few. This is clearly important in problems such as drug design, where one is interested in the conformational spread of a system.
547 citations
Cited by
More filters
[...]
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.
Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …
33,785 citations
01 May 1993
TL;DR: Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems.
Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.
29,323 citations
28 Jul 2005
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。
18,940 citations
TL;DR: The extensively curated SILVA taxonomy and the new non-redundant SILVA datasets provide an ideal reference for high-throughput classification of data from next-generation sequencing approaches.
Abstract: SILVA (from Latin silva, forest, http://www.arb-silva.de) is a comprehensive web resource for up to date, quality-controlled databases of aligned ribosomal RNA (rRNA) gene sequences from the Bacteria, Archaea and Eukaryota domains and supplementary online services. The referred database release 111 (July 2012) contains 3 194 778 small subunit and 288 717 large subunit rRNA gene sequences. Since the initial description of the project, substantial new features have been introduced, including advanced quality control procedures, an improved rRNA gene aligner, online tools for probe and primer evaluation and optimized browsing, searching and downloading on the website. Furthermore, the extensively curated SILVA taxonomy and the new non-redundant SILVA datasets provide an ideal reference for high-throughput classification of data from next-generation sequencing approaches.
18,256 citations
University of Massachusetts Amherst1, University of Michigan2, University of New Mexico3, University of British Columbia4, Texas A&M University5, University of Minnesota6, University of Warwick7, Dalhousie University8, Colorado School of Mines9, University of Ljubljana10, Graz University of Technology11, Louisiana State University12
TL;DR: M mothur is used as a case study to trim, screen, and align sequences; calculate distances; assign sequences to operational taxonomic units; and describe the α and β diversity of eight marine samples previously characterized by pyrosequencing of 16S rRNA gene fragments.
Abstract: mothur aims to be a comprehensive software package that allows users to use a single piece of software to analyze community sequence data. It builds upon previous tools to provide a flexible and powerful software package for analyzing sequencing data. As a case study, we used mothur to trim, screen, and align sequences; calculate distances; assign sequences to operational taxonomic units; and describe the alpha and beta diversity of eight marine samples previously characterized by pyrosequencing of 16S rRNA gene fragments. This analysis of more than 222,000 sequences was completed in less than 2 h with a laptop computer.
17,350 citations