Skip to content

Advertisement

Articles

Page 2 of 7

  1. Content type: Research

    Recently, Marcus et al. (Bioinformatics 30:3476–83, 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related s...

    Authors: Timo Beller and Enno Ohlebusch

    Citation: Algorithms for Molecular Biology 2016 11:20

    Published on:

    The Erratum to this article has been published in Algorithms for Molecular Biology 2016 11:28

  2. Content type: Research

    Metagenomics enables the analysis of bacterial population composition and the study of emergent population features, such as shared metabolic pathways. Recently, we have shown that metagenomics datasets can be...

    Authors: Elizabeth T. Hobbs, Talmo Pereira, Patrick K. O’Neill and Ivan Erill

    Citation: Algorithms for Molecular Biology 2016 11:19

    Published on:

  3. Content type: Research

    Superpositioning is an important problem in structural biology. Determining an optimal superposition requires a one-to-one correspondence between the atoms of two proteins structures. However, in practice, som...

    Authors: Jianbo Lu, Guoliang Xu, Shihua Zhang and Benzhuo Lu

    Citation: Algorithms for Molecular Biology 2016 11:18

    Published on:

  4. Content type: Research

    Identification of splice sites is essential for annotation of genes. Though existing approaches have achieved an acceptable level of accuracy, still there is a need for further improvement. Besides, most of th...

    Authors: Prabina Kumar Meher, Tanmaya Kumar Sahu, A. R. Rao and S. D. Wahi

    Citation: Algorithms for Molecular Biology 2016 11:16

    Published on:

  5. Content type: Research

    Sequence comparison is a fundamental step in many important tasks in bioinformatics; from phylogenetic reconstruction to the reconstruction of genomes. Traditional algorithms for measuring approximation in seq...

    Authors: Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha and Fatima Vayani

    Citation: Algorithms for Molecular Biology 2016 11:12

    Published on:

    The Erratum to this article has been published in Algorithms for Molecular Biology 2016 11:21

  6. Content type: Research

    The mutual exclusivity of somatic genome alterations (SGAs), such as somatic mutations and copy number alterations, is an important observation of tumors and is widely used to search for cancer signaling pathw...

    Authors: Songjian Lu, Gunasheil Mandava, Gaibo Yan and Xinghua Lu

    Citation: Algorithms for Molecular Biology 2016 11:11

    Published on:

  7. Content type: Software article

    Third generation sequencing platforms produce longer reads with higher error rates than second generation technologies. While the improved read length can provide useful information for downstream analysis, un...

    Authors: Giles Miclotte, Mahdi Heydari, Piet Demeester, Stephane Rombauts, Yves Van de Peer, Pieter Audenaert and Jan Fostier

    Citation: Algorithms for Molecular Biology 2016 11:10

    Published on:

  8. Content type: Research

    A large class of RNA secondary structure prediction programs uses an elaborate energy model grounded in extensive thermodynamic measurements and exact dynamic programming algorithms. External experimental evid...

    Authors: Ronny Lorenz, Ivo L. Hofacker and Peter F. Stadler

    Citation: Algorithms for Molecular Biology 2016 11:8

    Published on:

  9. Content type: Research

    Hash tables constitute a widely used data structure for indexing genomes that provides a list of genomic positions for each possible oligomer of a given size. The offset array in a hash table grows exponential...

    Authors: Thomas D. Wu

    Citation: Algorithms for Molecular Biology 2016 11:5

    Published on:

  10. Content type: Software article

    In this paper we propose a method and discuss its computational implementation as an integrated tool for the analysis of viral genetic diversity on data generated by high-throughput sequencing. The main motiva...

    Authors: Jean P. Zukurov, Sieberth do Nascimento-Brito, Angela C. Volpini, Guilherme C. Oliveira, Luiz Mario R. Janini and Fernando Antoneli

    Citation: Algorithms for Molecular Biology 2016 11:2

    Published on:

  11. Content type: Research

    The accurate annotation of genes in newly sequenced genomes remains a challenge. Although sophisticated comparative pipelines are available, computationally derived gene models are often less than perfect. Thi...

    Authors: Henrike Indrischek, Nicolas Wieseke, Peter F. Stadler and Sonja J. Prohaska

    Citation: Algorithms for Molecular Biology 2016 11:1

    Published on:

  12. Content type: Software article

    Markov chains are a common framework for individual-based state and time discrete models in evolution. Though they played an important role in the development of basic population genetic theory, the analysis o...

    Authors: Katja Reichel, Valentin Bahier, Cédric Midoux, Nicolas Parisey, Jean-Pierre Masson and Solenn Stoeckel

    Citation: Algorithms for Molecular Biology 2015 10:31

    Published on:

  13. Content type: Software article

    A number of alignment tools have been developed to align sequencing reads to the human reference genome. The scale of information from next-generation sequencing (NGS) experiments, however, is increasing rapid...

    Authors: Jongpill Choi, Kiejung Park, Seong Beom Cho and Myungguen Chung

    Citation: Algorithms for Molecular Biology 2015 10:30

    Published on:

  14. Content type: Research

    The rational, in silico prediction of gene-knockouts to turn organisms into efficient cell factories is an essential and computationally challenging task in metabolic engineering. Elementary flux mode analys...

    Authors: Govind Nair, Christian Jungreuthmayer, Michael Hanscho and Jürgen Zanghellini

    Citation: Algorithms for Molecular Biology 2015 10:29

    Published on:

  15. Content type: Research

    Lateral, or Horizontal, Gene Transfers are a type of asymmetric evolutionary events where genetic material is transferred from one species to another. In this paper we consider LGT networks, a general model of p...

    Authors: Gabriel Cardona, Joan Carles Pons and Francesc Rosselló

    Citation: Algorithms for Molecular Biology 2015 10:28

    Published on:

  16. Content type: Research

    Detecting protein complexes within protein–protein interaction (PPI) networks is a major step toward the analysis of biological processes and pathways. Identification and characterization of protein complexes ...

    Authors: Sanghamitra Bandyopadhyay, Sumanta Ray, Anirban Mukhopadhyay and Ujjwal Maulik

    Citation: Algorithms for Molecular Biology 2015 10:24

    Published on:

  17. Content type: Research

    Knowledge of interaction types in biological networks is important for understanding the functional organization of the cell. Currently information-based approaches are widely used for inferring gene regulator...

    Authors: Pegah Khosravi, Vahid H Gazestani, Leila Pirhaji, Brian Law, Mehdi Sadeghi, Bahram Goliaei and Gary D Bader

    Citation: Algorithms for Molecular Biology 2015 10:23

    Published on:

    The Erratum to this article has been published in Algorithms for Molecular Biology 2015 10:25

  18. Content type: Research

    Pareto optimization combines independent objectives by computing the Pareto front of its search space, defined as the set of all solutions for which no other candidate solution scores better under all objectives....

    Authors: Cédric Saule and Robert Giegerich

    Citation: Algorithms for Molecular Biology 2015 10:22

    Published on:

  19. Content type: Research

    The increase of protein–protein interaction (PPI) data of different species makes it possible to identify common subnetworks (conserved protein complexes) across species via local alignment of their PPI networ...

    Authors: Wei Peng, Jianxin Wang, Fangxiang Wu and Pan Yi

    Citation: Algorithms for Molecular Biology 2015 10:21

    Published on:

  20. Content type: Research

    The problem of enumerating bubbles with length constraints in directed graphs arises in transcriptomics where the question is to identify all alternative splicing events present in a sample of mRNAs sequenced ...

    Authors: Gustavo Sacomoto, Vincent Lacroix and Marie-France Sagot

    Citation: Algorithms for Molecular Biology 2015 10:20

    Published on:

  21. Content type: Research

    Analogous to genomic sequence alignment, biological network alignment identifies conserved regions between networks of different species. Then, function can be transferred from well- to poorly-annotated specie...

    Authors: Joseph Crawford, Yihan Sun and Tijana Milenković

    Citation: Algorithms for Molecular Biology 2015 10:19

    Published on:

  22. Content type: Research

    Resolution of repeats and scaffolding of shorter contigs are critical parts of genome assembly. Modern assemblers usually perform such steps by heuristics, often tailored to a particular technology for produci...

    Authors: Vladimír Boža, Broňa Brejová and Tomáš Vinař

    Citation: Algorithms for Molecular Biology 2015 10:18

    Published on:

  23. Content type: Research

    The core–periphery model for protein interaction (PPI) networks assumes that protein complexes in these networks consist of a dense core and a possibly sparse periphery that is adjacent to vertices in the core...

    Authors: Sharon Bruckner, Falk Hüffner and Christian Komusiewicz

    Citation: Algorithms for Molecular Biology 2015 10:16

    Published on:

  24. Content type: Research

    Autocatalytic sets are considered to be fundamental to the origin of life. Prior theoretical and computational work on the existence and properties of these sets has relied on a fast algorithm for detectingsel...

    Authors: Wim Hordijk, Joshua I Smith and Mike Steel

    Citation: Algorithms for Molecular Biology 2015 10:15

    Published on:

  25. Content type: Research

    Structural variation in genomes can be revealed by many (dis)similarity measures. Rearrangement operations, such as the so called double-cut-and-join (DCJ), are large-scale mutations that can create complex ch...

    Authors: Fábio V Martinez, Pedro Feijão, Marília DV Braga and Jens Stoye

    Citation: Algorithms for Molecular Biology 2015 10:13

    Published on:

  26. Content type: Research

    During evolution, global mutations may alter the order and the orientation of the genes in a genome. Such mutations are referred to as rearrangement events, or simply operations. In unichromosomal genomes, the...

    Authors: Gustavo Rodrigues Galvão, Orlando Lee and Zanoni Dias

    Citation: Algorithms for Molecular Biology 2015 10:12

    Published on:

  27. Content type: Research

    The body-bar Pebble Game (PG) algorithm is commonly used to calculate network rigidity properties in proteins and polymeric materials. To account for fluctuating interactions such as hydrogen bonds, an ensembl...

    Authors: Luis C González, Hui Wang, Dennis R Livesay and Donald J Jacobs

    Citation: Algorithms for Molecular Biology 2015 10:11

    Published on:

  28. Content type: Research

    Several sources of noise obfuscate the identification of single nucleotide variation (SNV) in next generation sequencing data. For instance, errors may be introduced during library construction and sequencing ...

    Authors: Steve Hoffmann, Peter F Stadler and Korbinian Strimmer

    Citation: Algorithms for Molecular Biology 2015 10:10

    Published on:

  29. Content type: Research

    This paper presents a constraint-based method for improving protein docking results. Efficient constraint propagation cuts over 95% of the search time for finding the configurations with the largest contact su...

    Authors: Ludwig Krippahl and Pedro Barahona

    Citation: Algorithms for Molecular Biology 2015 10:9

    Published on:

  30. Content type: Review article

    Interaction sites on protein surfaces mediate virtually all biological activities, and their identification holds promise for disease treatment and drug design. Novel algorithmic approaches for the prediction ...

    Authors: Tristan T Aumentado-Armstrong, Bogdan Istrate and Robert A Murgita

    Citation: Algorithms for Molecular Biology 2015 10:7

    Published on:

  31. Content type: Research

    Alignment-free methods are increasingly used to calculate evolutionary distances between DNA and protein sequences as a basis of phylogeny reconstruction. Most of these methods, however, use heuristic distance...

    Authors: Burkhard Morgenstern, Bingyao Zhu, Sebastian Horwege and Chris André Leimeister

    Citation: Algorithms for Molecular Biology 2015 10:5

    Published on:

  32. Content type: Research

    The data volume generated by Next-Generation Sequencing (NGS) technologies is growing at a pace that is now challenging the storage and data processing capacities of modern computer systems. In this context an...

    Authors: Matteo Comin, Andrea Leoni and Michele Schimd

    Citation: Algorithms for Molecular Biology 2015 10:4

    Published on:

  33. Content type: SOFTWARE ARTICLE

    Phylogenetic tree reconciliation is the approach of choice for investigating the coevolution of sets of organisms such as hosts and parasites. It consists in a mapping between the parasite tree and the host tr...

    Authors: Beatrice Donati, Christian Baudet, Blerina Sinaimeri, Pierluigi Crescenzi and Marie-France Sagot

    Citation: Algorithms for Molecular Biology 2015 10:3

    Published on:

  34. Content type: Research

    Metagenomics is the study of genetic materials derived directly from complex microbial samples, instead of from culture. One of the crucial steps in metagenomic analysis, referred to as “binning”, is to separa...

    Authors: Le Van Vinh, Tran Van Lang, Le Thanh Binh and Tran Van Hoai

    Citation: Algorithms for Molecular Biology 2015 10:2

    Published on: