2,221 research outputs found

    Convergence Acceleration Techniques

    Full text link
    This work describes numerical methods that are useful in many areas: examples include statistical modelling (bioinformatics, computational biology), theoretical physics, and even pure mathematics. The methods are primarily useful for the acceleration of slowly convergent and the summation of divergent series that are ubiquitous in relevant applications. The computing time is reduced in many cases by orders of magnitude.Comment: 6 pages, LaTeX; provides an easy-to-understand introduction to the field of convergence acceleratio

    From genes to networks: in systematic points of view

    Get PDF
    We present a report of the BIOCOMP'10 - The 2010 International Conference on Bioinformatics & Computational Biology and other related work in the area of systems biology

    Genomic signatures and gene networking: challenges and promises

    Get PDF
    This is an editorial report of the supplement to BMC Genomics that includes 15 papers selected from the BIOCOMP'10 - The 2010 International Conference on Bioinformatics & Computational Biology as well as other sources with a focus on genomics studies

    Bioinformatics in Italy: BITS2011, the Eighth Annual Meeting of the Italian Society of Bioinformatics

    Get PDF
    The BITS2011 meeting, held in Pisa on June 20-22, 2011, brought together more than 120 Italian researchers working in the field of Bioinformatics, as well as students in Bioinformatics, Computational Biology, Biology, Computer Sciences, and Engineering, representing a landscape of Italian bioinformatics research

    Hierarchical clustering based structural learning of Bayesian networks

    Get PDF
    Bayesian networks are being used in various domains, such as data mining, diagnosis, bioinformatics/computational biology, etc. One problem associated with Bayesian networks is to learn their structures from training data. In this paper, we introduce a new approach to structural learning of Bayesian networks, based on hierarchical clustering. We learn the network in hierarchical stages, learning over a subset of the random variables at each stage. Experiments show that this approach learns Bayesian networks faster as compared to curriculum-based learning methods. We show a comparison of our networks with curriculum based learned Bayesian networks over different evaluation metrics as well. Also, performance of hierarchical clustering vs an existing ordering-based algorithm is observed

    NETTAB 2012 on “Integrated Bio-Search”

    Get PDF
    The NETTAB 2012 workshop, held in Como on November 14-16, 2012, was devoted to "Integrated Bio-Search", that is to technologies, methods, architectures, systems and applications for searching, retrieving, integrating and analyzing data, information, and knowledge with the aim of answering complex bio-medical-molecular questions, i.e. some of the most challenging issues in bioinformatics today. It brought together about 80 researchers working in the field of Bioinformatics, Computational Biology, Biology, Computer Science and Engineering. More than 50 scientific contributions, including keynote and tutorial talks, oral communications, posters and software demonstrations, were presented at the workshop. This preface provides a brief overview of the workshop and shortly introduces the peer-reviewed manuscripts that were accepted for publication in this Supplement
    • …
    corecore