Skip to content

Advertisement

Articles

Page 1 of 7

  1. Content type: Research

    Sequencing technologies produce larger and larger collections of biosequences that have to be stored in compressed indices supporting fast search operations. Many compressed indices are based on the Burrows–Wh...

    Authors: Lavinia Egidi, Felipe A. Louza, Giovanni Manzini and Guilherme P. Telles

    Citation: Algorithms for Molecular Biology 2019 14:6

    Published on:

  2. Content type: Research

    Network connectivity problems are abundant in computational biology research, where graphs are used to represent a range of phenomena: from physical interactions between molecules to more abstract relationship...

    Authors: Jimmy Wu, Alex Khodaverdian, Benjamin Weitz and Nir Yosef

    Citation: Algorithms for Molecular Biology 2019 14:5

    Published on:

  4. Content type: Research

    Sequencing technologies keep on turning cheaper and faster, thus putting a growing pressure for data structures designed to efficiently store raw data, and possibly perform analysis therein. In this view, ther...

    Authors: Nicola Prezza, Nadia Pisanti, Marinella Sciortino and Giovanna Rosone

    Citation: Algorithms for Molecular Biology 2019 14:3

    Published on:

  5. Content type: Research

    Absolute fast converging (AFC) phylogeny estimation methods are ones that have been proven to recover the true tree with high probability given sequences whose lengths are polynomial in the number of number of...

    Authors: Qiuyi Zhang, Satish Rao and Tandy Warnow

    Citation: Algorithms for Molecular Biology 2019 14:2

    Published on:

  6. Content type: Research

    A key factor in computational drug design is the consistency and reliability with which intermolecular interactions between a wide variety of molecules can be described. Here we present a procedure to efficien...

    Authors: Martin S. Engler, Bertrand Caron, Lourens Veen, Daan P. Geerke, Alan E. Mark and Gunnar W. Klau

    Citation: Algorithms for Molecular Biology 2019 14:1

    Published on:

  7. Content type: Software article

    Motif analysis methods have long been central for studying biological function of nucleotide sequences. Functional genomics experiments extend their potential. They typically generate sequence lists ranked by ...

    Authors: Morten Muhlig Nielsen, Paula Tataru, Tobias Madsen, Asger Hobolth and Jakob Skou Pedersen

    Citation: Algorithms for Molecular Biology 2018 13:17

    Published on:

  8. Content type: Research

    Superbubbles are distinctive subgraphs in direct graphs that play an important role in assembly algorithms for high-throughput sequencing (HTS) data. Their practical importance derives from the fact they are c...

    Authors: Fabian Gärtner, Lydia Müller and Peter F. Stadler

    Citation: Algorithms for Molecular Biology 2018 13:16

    Published on:

  9. Content type: Research

    Genome sequences and genome annotation data have become available at ever increasing rates in response to the rapid progress in sequencing technologies. As a consequence the demand for methods supporting compa...

    Authors: Fabian Gärtner, Christian Höner zu Siederdissen, Lydia Müller and Peter F. Stadler

    Citation: Algorithms for Molecular Biology 2018 13:15

    Published on:

  10. Content type: Research

    Liquid chromatography combined with tandem mass spectrometry is an important tool in proteomics for peptide identification. Liquid chromatography temporally separates the peptides in a sample. The peptides tha...

    Authors: Yves Frank, Tomas Hruz, Thomas Tschager and Valentin Venzin

    Citation: Algorithms for Molecular Biology 2018 13:14

    Published on:

  11. Content type: Research

    One way to estimate the evolutionary distance between two given genomes is to determine the minimum number of large-scale mutations, or genome rearrangements, that are necessary to transform one into the other. I...

    Authors: Andre R. Oliveira, Guillaume Fertin, Ulisses Dias and Zanoni Dias

    Citation: Algorithms for Molecular Biology 2018 13:13

    Published on:

  12. Content type: Research

    Most phylogenetic studies using molecular data treat gaps in multiple sequence alignments as missing data or even completely exclude alignment columns that contain gaps.

    Authors: Alexander Donath and Peter F. Stadler

    Citation: Algorithms for Molecular Biology 2018 13:12

    Published on:

  15. Content type: Research

    The double cut and join (DCJ) model of genome rearrangement is well studied due to its mathematical simplicity and power to account for the many events that transform gene order. These studies have mostly been...

    Authors: Pijus Simonaitis and Krister M. Swenson

    Citation: Algorithms for Molecular Biology 2018 13:9

    Published on:

  16. Content type: Research

    Patterns with wildcards in specified positions, namely spaced seeds, are increasingly used instead of k-mers in many bioinformatics applications that require indexing, querying and rapid similarity search, as the...

    Authors: Samuele Girotto, Matteo Comin and Cinzia Pizzi

    Citation: Algorithms for Molecular Biology 2018 13:8

    Published on:

  17. Content type: Research

    An important task in a metagenomic analysis is the assignment of taxonomic labels to sequences in a sample. Most widely used methods for taxonomy assignment compare a sequence in the sample to a database of kn...

    Authors: Nidhi Shah, Stephen F. Altschul and Mihai Pop

    Citation: Algorithms for Molecular Biology 2018 13:7

    Published on:

  18. Content type: Research

    For a combination of reasons (including data generation protocols, approaches to taxon and gene sampling, and gene birth and loss), estimated gene trees are often incomplete, meaning that they do not contain a...

    Authors: Sarah Christensen, Erin K. Molloy, Pranjal Vachaspati and Tandy Warnow

    Citation: Algorithms for Molecular Biology 2018 13:6

    Published on:

  19. Content type: Research

    A profile-comparison method with position-specific scoring matrix (PSSM) is among the most accurate alignment methods. Currently, cosine similarity and correlation coefficients are used as scoring functions of...

    Authors: Kazunori D. Yamada

    Citation: Algorithms for Molecular Biology 2018 13:5

    Published on:

  20. Content type: Research

    Microbial typing methods are commonly used to study the relatedness of bacterial strains. Sequence-based typing methods are a gold standard for epidemiological surveillance due to the inherent portability of s...

    Authors: João A. Carriço, Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Bruno Ribeiro-Gonçalves and Cátia Vaz

    Citation: Algorithms for Molecular Biology 2018 13:4

    Published on:

  21. Content type: Research

    Reconstructing the genome of a species from short fragments is one of the oldest bioinformatics problems. Metagenomic assembly is a variant of the problem asking to reconstruct the circular genomes of all bact...

    Authors: Nidia Obscura Acosta, Veli Mäkinen and Alexandru I. Tomescu

    Citation: Algorithms for Molecular Biology 2018 13:3

    Published on:

  22. Content type: Research

    In the absence of horizontal gene transfer it is possible to reconstruct the history of gene families from empirically determined orthology relations, which are equivalent to event-labeled gene trees. Knowledge o...

    Authors: Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke and Marc Hellmuth

    Citation: Algorithms for Molecular Biology 2018 13:2

    Published on:

  24. Content type: Research

    Various approaches to alignment-free sequence comparison are based on the length of exact or inexact word matches between pairs of input sequences. Haubold et al. (J Comput Biol 16:1487–1500, 2009) showed how the...

    Authors: Burkhard Morgenstern, Svenja Schöbel and Chris-André Leimeister

    Citation: Algorithms for Molecular Biology 2017 12:27

    Published on:

  25. Content type: Research

    Suffix arrays, augmented by additional data structures, allow solving efficiently many string processing problems. The external memory construction of the generalized suffix array for a string collection is a ...

    Authors: Felipe A. Louza, Guilherme P. Telles, Steve Hoffmann and Cristina D. A. Ciferri

    Citation: Algorithms for Molecular Biology 2017 12:26

    Published on:

  26. Content type: Research

    Multiple sequence alignment (MSA) plays a key role in biological sequence analyses, especially in phylogenetic tree construction. Extreme increase in next-generation sequencing results in shortage of efficient...

    Authors: Shixiang Wan and Quan Zou

    Citation: Algorithms for Molecular Biology 2017 12:25

    Published on:

  27. Content type: Research

    In order to find correlated pairs of positions between proteins, which are useful in predicting interactions, it is necessary to concatenate two large multiple sequence alignments such that the sequences that ...

    Authors: William R. Taylor

    Citation: Algorithms for Molecular Biology 2017 12:24

    Published on:

  29. Content type: Research

    Genomic DNA frequently undergoes rearrangement of the gene order that can be localized by comparing the two DNA sequences. In mitochondrial genomes different mechanisms are likely at work, at least some of whi...

    Authors: Marwa Al Arab, Matthias Bernt, Christian Höner zu Siederdissen, Kifah Tout and Peter F. Stadler

    Citation: Algorithms for Molecular Biology 2017 12:22

    Published on:

  30. Content type: Research

    Mixtures of beta distributions are a flexible tool for modeling data with values on the unit interval, such as methylation levels. However, maximum likelihood parameter estimation with beta distributions suffe...

    Authors: Christopher Schröder and Sven Rahmann

    Citation: Algorithms for Molecular Biology 2017 12:21

    Published on:

  31. Content type: Research

    This paper addresses the problem of finding attractors in biological regulatory networks. We focus here on non-deterministic synchronous and asynchronous multi-valued networks, modeled using automata networks ...

    Authors: Emna Ben Abdallah, Maxime Folschette, Olivier Roux and Morgan Magnin

    Citation: Algorithms for Molecular Biology 2017 12:20

    Published on:

  32. Content type: Research

    Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject...

    Authors: Louis Fippo Fitime, Olivier Roux, Carito Guziolowski and Loïc Paulevé

    Citation: Algorithms for Molecular Biology 2017 12:19

    Published on:

  34. Content type: Research

    Isometric gene tree reconciliation is a gene tree/species tree reconciliation problem where both the gene tree and the species tree include branch lengths, and these branch lengths must be respected by the rec...

    Authors: Broňa Brejová, Askar Gafurov, Dana Pardubská, Michal Sabo and Tomáš Vinař

    Citation: Algorithms for Molecular Biology 2017 12:17

    Published on:

  36. Content type: Research

    In this work, we present a new coarse grained representation of RNA dynamics. It is based on adjacency matrices and their interactions patterns obtained from molecular dynamics simulations. RNA molecules are w...

    Authors: Sven Jager, Benjamin Schiller, Philipp Babel, Malte Blumenroth, Thorsten Strufe and Kay Hamacher

    Citation: Algorithms for Molecular Biology 2017 12:15

    Published on:

  37. Content type: Research

    The gene family-free framework for comparative genomics aims at providing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity graph. We ...

    Authors: Daniel Doerr, Metin Balaban, Pedro Feijão and Cedric Chauve

    Citation: Algorithms for Molecular Biology 2017 12:14

    Published on:

  38. Content type: Research

    Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the n...

    Authors: Mohammed El-Kebir, Benjamin J. Raphael, Ron Shamir, Roded Sharan, Simone Zaccaria, Meirav Zehavi and Ron Zeira

    Citation: Algorithms for Molecular Biology 2017 12:13

    Published on:

  39. Content type: Research

    Given a peptide as a string of amino acids, the masses of all its prefixes and suffixes can be found by a trivial linear scan through the amino acid masses. The inverse problem is the ideal ...

    Authors: Thomas Tschager, Simon Rösch, Ludovic Gillet and Peter Widmayer

    Citation: Algorithms for Molecular Biology 2017 12:12

    Published on:

  40. Content type: Research

    In a computed protein multiple sequence alignment, the coreness of a column is the fraction of its substitutions that are in so-called core columns of the gold-standard reference alignment of its proteins. In ben...

    Authors: Dan DeBlasio and John Kececioglu

    Citation: Algorithms for Molecular Biology 2017 12:11

    Published on:

  41. Content type: Research

    Frameshift translation is an important phenomenon that contributes to the appearance of novel coding DNA sequences (CDS) and functions in gene evolution, by allowing alternative amino acid translations of gene...

    Authors: Safa Jammali, Esaie Kuitche, Ayoub Rachati, François Bélanger, Michelle Scott and Aïda Ouangraoua

    Citation: Algorithms for Molecular Biology 2017 12:10

    Published on:

  42. Content type: Research

    A basic task in bioinformatics is the counting of k-mers in genome sequences. Existing k-mer counting tools are most often optimized for small k < 32 and suffer from excessive memory resource consumption or degra...

    Authors: Marius Erbert, Steffen Rechner and Matthias Müller-Hannemann

    Citation: Algorithms for Molecular Biology 2017 12:9

    Published on:

  43. Content type: Software article

    Systems research spanning fields from biology to finance involves the identification of models to represent the underpinnings of complex systems. Formal approaches for data-driven identification of network int...

    Authors: Raghuram Thiagarajan, Amir Alavi, Jagdeep T. Podichetty, Jason N. Bazil and Daniel A. Beard

    Citation: Algorithms for Molecular Biology 2017 12:8

    Published on:

  45. Content type: Research

    Phylogenetic tree reconciliation is a widely-used method for inferring the evolutionary histories of genes and species. In the duplication-loss-coalescence (DLC) model, we seek a reconciliation that explains t...

    Authors: Daniel Bork, Ricson Cheng, Jincheng Wang, Jean Sung and Ran Libeskind-Hadas

    Citation: Algorithms for Molecular Biology 2017 12:6

    Published on:

  46. Content type: Research

    The deviation of the observed frequency of a word w from its expected frequency in a given sequence x is used to determine whether or not the word is avoided. This concept is particularly useful in DNA linguisti...

    Authors: Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis and Dimitris Polychronopoulos

    Citation: Algorithms for Molecular Biology 2017 12:5

    Published on:

  48. Content type: Research

    Rearrangements are large-scale mutations in genomes, responsible for complex changes and structural variations. Most rearrangements that modify the organization of a genome can be represented by the double cut...

    Authors: Diego P. Rubert, Pedro Feijão, Marília Dias Vieira Braga, Jens Stoye and Fábio Henrique Viduani Martinez

    Citation: Algorithms for Molecular Biology 2017 12:3

    Published on:

  49. Content type: Research

    The main challenge in de novo genome assembly of DNA-seq data is certainly to deal with repeats that are longer than the reads. In de novo transcriptome assembly of RNA-seq reads, on the other hand, this prob...

    Authors: Leandro Lima, Blerina Sinaimeri, Gustavo Sacomoto, Helene Lopez-Maestre, Camille Marchet, Vincent Miele, Marie-France Sagot and Vincent Lacroix

    Citation: Algorithms for Molecular Biology 2017 12:2

    Published on:

  • ISSN: 1748-7188 (electronic)

Advertisement

Algorithms for Molecular Biology

ISSN: 1748-7188