58 results match your criteria: "Institute for Theoretical Informatics[Affiliation]"
Proc Natl Acad Sci U S A
June 2020
Emerging Pathogens Institute, University of Florida, Gainesville, FL 32609;
Genome Biol
February 2020
Life Sciences and Health, Centrum Wiskunde & Informatica, Amsterdam, The Netherlands.
Bioinformatics
May 2020
Computational Molecular Evolution Group, Heidelberg Institute for Theoretical Studies, Heidelberg 69118, Germany.
Bioinformatics
April 2020
Computational Molecular Evolution Group, Heidelberg Institute for Theoretical Studies, Heidelberg 69118.
PeerJ
October 2019
Centre for Life's Origins and Evolution, Department of Genetics Evolution and Environment, University College London, University of London, London, United Kingdom.
PLoS One
February 2020
Computational Molecular Evolution Group, Heidelberg Institute for Theoretical Studies, Heidelberg, Germany.
Mol Biol Evol
September 2019
European Molecular Biology Laboratory, European Bioinformatics Institute, Hinxton, Cambridgeshire, United Kingdom.
Iperception
September 2018
Institute for Theoretical Informatics, Karlsruhe Institute of Technology, Germany.
Positive effects of aesthetically appreciated designs have long been studied and confirmed since the 19th century: such designs are more enjoyable, they are more forgivable for glitches and can increase users' performance. In the field of information visualization, studies of aesthetics are still a niche approach. In the current study, we aim to specifically understand which parameters in a visualization of node-link diagrams make them aesthetically pleasing-an important extension to already existing research on usability and readability aspects.
View Article and Find Full Text PDFBioinformatics
April 2019
Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Heidelberg, Germany.
Bioinformatics
October 2018
Institute for Theoretical Informatics, Karlsruhe Institute of Technology, Karlsruhe, Germany.
Motivation: The presence of terraces in phylogenetic tree space, i.e. a potentially large number of distinct tree topologies that have exactly the same analytical likelihood score, was first described by Sanderson et al.
View Article and Find Full Text PDFNat Commun
April 2018
Laboratory of Applied Chemistry, Institute of Organic Chemistry (IOC), Karlsruhe Institute of Technology (KIT), Straße am Forum 7, Karlsruhe, 76131, Germany.
A convenient and inherently more secure communication channel for encoding messages via specifically designed molecular keys is introduced by combining advanced encryption standard cryptography with molecular steganography. The necessary molecular keys require large structural diversity, thus suggesting the application of multicomponent reactions. Herein, the Ugi four-component reaction of perfluorinated acids is utilized to establish an exemplary database consisting of 130 commercially available components.
View Article and Find Full Text PDFAm J Bot
March 2018
Royal Botanic Gardens, Kew, TW9 3AE, Richmond, Surrey, UK.
Mol Phylogenet Evol
August 2018
Natural History Museum of Crete, School of Sciences and Engineering, University of Crete, Knosos Avenue, Irakleio GR71409, Greece; Department of Biology, School of Sciences and Engineering, University of Crete, Vassilika Vouton, Irakleio GR70013, Greece.
BMC Evol Biol
February 2018
Center for Integrative Bioinformatics Vienna, Max F. Perutz Laboratories, University of Vienna, Medical University Vienna, Campus Vienna Biocenter 5, A-1030, Vienna, Austria.
Background: The nonparametric bootstrap is widely used to measure the branch support of phylogenetic trees. However, bootstrapping is computationally expensive and remains a bottleneck in phylogenetic analyses. Recently, an ultrafast bootstrap approximation (UFBoot) approach was proposed for maximum likelihood analyses.
View Article and Find Full Text PDFNat Ecol Evol
March 2017
Department of Ecology, University of Kaiserslautern, Erwin-Schrödinger-Straße, 67663 Kaiserslautern, Germany.
BMC Bioinformatics
July 2017
Predictive Medicine and Data Analytics Lab, Department of Signal Processing, Tampere University of Technology, Tampere, Finland.
Background: sgnesR (Stochastic Gene Network Expression Simulator in R) is an R package that provides an interface to simulate gene expression data from a given gene network using the stochastic simulation algorithm (SSA). The package allows various options for delay parameters and can easily included in reactions for promoter delay, RNA delay and Protein delay. A user can tune these parameters to model various types of reactions within a cell.
View Article and Find Full Text PDFAIDS Res Hum Retroviruses
November 2017
Oxford Big Data Institute, Li Ka Shing Centre for Health Information and Discovery, Nuffield Department of Medicine, Oxford, United Kingdom of Great Britain and Northern Ireland ;
To characterize HIV-1 transmission dynamics in regions where the burden of HIV-1 is greatest, the 'Phylogenetics and Networks for Generalised HIV Epidemics in Africa' consortium (PANGEA-HIV) is sequencing full-genome viral isolates from across sub-Saharan Africa. We report the first 3,985 PANGEA-HIV consensus sequences from four cohort sites (Rakai Community Cohort Study, n=2,833; MRC/UVRI Uganda, n=701; Mochudi Prevention Project, n=359; Africa Health Research Institute Resistance Cohort, n=92). Next-generation sequencing success rates varied: more than 80% of the viral genome from the gag to the nef genes could be determined for all sequences from South Africa, 75% of sequences from Mochudi, 60% of sequences from MRC/UVRI Uganda, and 22% of sequences from Rakai.
View Article and Find Full Text PDFMol Biol Evol
June 2017
Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Heidelberg, Germany.
J Eukaryot Microbiol
May 2017
Sorbonne Universités UPMC Université Paris 06 & CNRS, UMR7144, Station Biologique de Roscoff, Place Georges Teissier, Roscoff, 29680, France.
Universal taxonomic frameworks have been critical tools to structure the fields of botany, zoology, mycology, and bacteriology as well as their large research communities. Animals, plants, and fungi have relatively solid, stable morpho-taxonomies built over the last three centuries, while bacteria have been classified for the last three decades under a coherent molecular taxonomic framework. By contrast, no such common language exists for microbial eukaryotes, even though environmental '-omics' surveys suggest that protists make up most of the organismal and genetic complexity of our planet's ecosystems! With the current deluge of eukaryotic meta-omics data, we urgently need to build up a universal eukaryotic taxonomy bridging the protist -omics age to the fragile, centuries-old body of classical knowledge that has effectively linked protist taxa to morphological, physiological, and ecological information.
View Article and Find Full Text PDFSyst Biol
March 2017
Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schoβ-wolysbronnenweg 35, 69118 Heidelberg, Germany.
The phylogenetic likelihood function (PLF) is the major computational bottleneck in several applications of evolutionary biology such as phylogenetic inference, species delimitation, model selection, and divergence times estimation. Given the alignment, a tree and the evolutionary model parameters, the likelihood function computes the conditional likelihood vectors for every node of the tree. Vector entries for which all input data are identical result in redundant likelihood operations which, in turn, yield identical conditional values.
View Article and Find Full Text PDFPeerJ
October 2016
Department of Ecology, University of Kaiserslautern, Kaiserslautern, Germany; UMR LSTM, CIRAD, Montpellier, France.
Background: VSEARCH is an open source and free of charge multithreaded 64-bit tool for processing and preparing metagenomics, genomics and population genomics nucleotide sequence data. It is designed as an alternative to the widely used USEARCH tool (Edgar, 2010) for which the source code is not publicly available, algorithm details are only rudimentarily described, and only a memory-confined 32-bit version is freely available for academic use.
Methods: When searching nucleotide sequences, VSEARCH uses a fast heuristic based on words shared by the query and target sequences in order to quickly identify similar sequences, a similar strategy is probably used in USEARCH.
Philos Trans R Soc Lond B Biol Sci
September 2016
Department of Entomology and Nematology, University of California-Davis, 1282 Academic Surge, Davis, CA 95616, USA
DNA barcoding was intended as a means to provide species-level identifications through associating DNA sequences from unknown specimens to those from curated reference specimens. Although barcodes were not designed for phylogenetics, they can be beneficial to the completion of the Tree of Life. The barcode database for Trichoptera is relatively comprehensive, with data from every family, approximately two-thirds of the genera, and one-third of the described species.
View Article and Find Full Text PDFNucleic Acids Res
June 2016
The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, 69118 Heidelberg, Germany Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Postfach 6980, 76128 Karlsruhe, Germany.
BMC Bioinformatics
March 2016
Predictive Medicine and Analytics Lab, Department of Signal Processing, Tampere University of Technology, Tampere, Finland.
Background: It is generally acknowledged that a functional understanding of a biological system can only be obtained by an understanding of the collective of molecular interactions in form of biological networks. Protein networks are one particular network type of special importance, because proteins form the functional base units of every biological cell. On a mesoscopic level of protein networks, modules are of significant importance because these building blocks may be the next elementary functional level above individual proteins allowing to gain insight into fundamental organizational principles of biological cells.
View Article and Find Full Text PDFMol Biol Evol
June 2016
Heidelberg Institute for Theoretical Studies, Heidelberg, Germany Institute for Theoretical Informatics, Karlsruhe Institute of Technology, Postfach 6980, Karlsruhe, 76128, Germany.
We present, implement, and evaluate an approach to calculate the internode certainty (IC) and tree certainty (TC) on a given reference tree from a collection of partial gene trees. Previously, the calculation of these values was only possible from a collection of gene trees with exactly the same taxon set as the reference tree. An application to sets of partial gene trees requires mathematical corrections in the IC and TC calculations.
View Article and Find Full Text PDF