Skip to main content

Articles

Page 4 of 8

  2. 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

    Content type: Research

    Published on:

  3. 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

    Content type: Research

    Published on:

  5. 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

    Content type: Research

    Published on:

  6. 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

    Content type: Research

    Published on:

  7. 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

    Content type: Research

    Published on:

  8. 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

    Content type: Research

    Published on:

  9. 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

    Content type: Research

    Published on:

  11. 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

    Content type: Review article

    Published on:

  13. 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

    Content type: Research

    Published on:

  14. 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

    Content type: Research

    Published on:

  15. 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

    Content type: SOFTWARE ARTICLE

    Published on:

  16. 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

    Content type: Research

    Published on:

  18. The universal pacemaker (UPM) model extends the classical molecular clock (MC) model, by allowing each gene, in addition to its individual intrinsic rate as in the MC, to accelerate or decelerate according to ...

    Authors: Sagi Snir

    Citation: Algorithms for Molecular Biology 2014 9:26

    Content type: Research

    Published on:

  19. Biclustering, the discovery of sets of objects with a coherent pattern across a subset of conditions, is a critical task to study a wide-set of biomedical problems, where molecular units or patients are meanin...

    Authors: Rui Henriques and Sara C Madeira

    Citation: Algorithms for Molecular Biology 2014 9:27

    Content type: Research

    Published on:

  20. Finding new functional fragments in biological sequences is a challenging problem. Methods addressing this problem commonly search for clusters of pattern occurrences that are statistically significant. A meas...

    Authors: Mireille Régnier, Evgenia Furletova, Victor Yakovlev and Mikhail Roytberg

    Citation: Algorithms for Molecular Biology 2014 9:25

    Content type: Research

    Published on:

  22. Chemical reactions are rearrangements of chemical bonds. Each atom in an educt molecule thus appears again in a specific position of one of the reaction products. This bijection between educt and product atoms...

    Authors: Martin Mann, Feras Nahar, Norah Schnorr, Rolf Backofen, Peter F Stadler and Christoph Flamm

    Citation: Algorithms for Molecular Biology 2014 9:23

    Content type: Research

    Published on:

  23. Sets of sequence data used in phylogenetic analysis are often plagued by both random noise and systematic biases. Since the commonly used methods of phylogenetic reconstruction are designed to produce trees it...

    Authors: Bernhard Misof, Karen Meusemann, Björn M von Reumont, Patrick Kück, Sonja J Prohaska and Peter F Stadler

    Citation: Algorithms for Molecular Biology 2014 9:22

    Content type: Review article

    Published on:

  24. Large RNA molecules are often composed of multiple functional domains whose spatial arrangement strongly influences their function. Pre-mRNA splicing, for instance, relies on the spatial proximity of the splic...

    Authors: Jing Qin, Markus Fricke, Manja Marz, Peter F Stadler and Rolf Backofen

    Citation: Algorithms for Molecular Biology 2014 9:19

    Content type: Research

    Published on:

  25. Tandem duplication, in the context of molecular biology, occurs as a result of mutational events in which an original segment of DNA is converted into a sequence of individual copies. More formally, a repetition ...

    Authors: Carl Barton, Costas S Iliopoulos and Solon P Pissis

    Citation: Algorithms for Molecular Biology 2014 9:21

    Content type: Research

    Published on:

  26. An important problem in systems biology is to model gene regulatory networks which can then be utilized to develop novel therapeutic methods for cancer treatment. Knowledge about which proteins/genes are dysre...

    Authors: Anwoy Kumar Mohanty, Aniruddha Datta and Vijayanagaram Venkatraj

    Citation: Algorithms for Molecular Biology 2014 9:20

    Content type: Research

    Published on:

  28. RNA-RNA interaction plays an important role in the regulation of gene expression and cell development. In this process, an RNA molecule prohibits the translation of another RNA molecule by establishing stable ...

    Authors: Soheila Montaseri, Fatemeh Zare-Mirakabad and Nasrollah Moghadam-Charkari

    Citation: Algorithms for Molecular Biology 2014 9:17

    Content type: Research

    Published on:

  31. Chromosome conformation capture experiments have led to the discovery of dense, contiguous, megabase-sized topological domains that are similar across cell types and conserved across species. These domains are...

    Authors: Darya Filippova, Rob Patro, Geet Duggal and Carl Kingsford

    Citation: Algorithms for Molecular Biology 2014 9:14

    Content type: Research

    Published on:

  33. Progressive methods offer efficient and reasonably good solutions to the multiple sequence alignment problem. However, resulting alignments are biased by guide-trees, especially for relatively distant sequences.

    Authors: Michał Modzelewski and Norbert Dojer

    Citation: Algorithms for Molecular Biology 2014 9:12

    Content type: Research

    Published on:

  35. The number of genome-wide association studies (GWAS) has increased rapidly in the past couple of years, resulting in the identification of genes associated with different diseases. The next step in translating...

    Authors: Usha Kuppuswamy, Seshan Ananthasubramanian, Yanli Wang, Narayanaswamy Balakrishnan and Madhavi K Ganapathiraju

    Citation: Algorithms for Molecular Biology 2014 9:10

    Content type: Research

    Published on:

  36. Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. There exist optima...

    Authors: Carl Barton, Costas S Iliopoulos and Solon P Pissis

    Citation: Algorithms for Molecular Biology 2014 9:9

    Content type: Research

    Published on:

  38. Identifying ligand-binding sites is a key step to annotate the protein functions and to find applications in drug design. Now, many sequence-based methods adopted various predicted results from other classifie...

    Authors: Chun Fang, Tamotsu Noguchi and Hayato Yamana

    Citation: Algorithms for Molecular Biology 2014 9:7

    Content type: Research

    Published on:

  39. Change point problems arise in many genomic analyses such as the detection of copy number variations or the detection of transcribed regions. The expanding Next Generation Sequencing technologies now allow to ...

    Authors: Alice Cleynen, Michel Koskas, Emilie Lebarbier, Guillem Rigaill and Stéphane Robin

    Citation: Algorithms for Molecular Biology 2014 9:6

    Content type: Software article

    Published on:

  40. The secondary structure that maximizes the number of non-crossing matchings between complimentary bases of an RNA sequence of length n can be computed in O(n3) time using Nussinov’s dynamic programming algorithm....

    Authors: Balaji Venkatachalam, Dan Gusfield and Yelena Frid

    Citation: Algorithms for Molecular Biology 2014 9:5

    Content type: Research

    Published on:

  41. Multiple sequence alignment (MSA) is an extremely useful tool for molecular and evolutionary biology and there are several programs and algorithms available for this purpose. Although previous studies have com...

    Authors: Fabiano Sviatopolk-Mirsky Pais, Patrícia de Cássia Ruy, Guilherme Oliveira and Roney Santos Coimbra

    Citation: Algorithms for Molecular Biology 2014 9:4

    Content type: Research

    Published on:

  44. The sheer amounts of biological data that are generated in recent years have driven the development of network analysis tools to facilitate the interpretation and representation of these data. A fundamental ch...

    Authors: Arnon Mazza, Irit Gat-Viks, Hesso Farhan and Roded Sharan

    Citation: Algorithms for Molecular Biology 2014 9:1

    Content type: Research

    Published on:

  45. Hidden Markov Models power many state‐of‐the‐art tools in the field of protein bioinformatics. While excelling in their tasks, these methods of protein analysis do not convey directly information on medium‐ an...

    Authors: Witold Dyrka, Jean‐Christophe Nebel and Malgorzata Kotulska

    Citation: Algorithms for Molecular Biology 2013 8:31

    Content type: Research

    Published on:

  46. In this paper, we present a novel approximation algorithm to solve the protein folding problem in HP model. Our algorithm is polynomial in terms of the length of the given HP string. The expected approximation...

    Authors: Abu Sayed Md Sohidull Islam and Mohammad Sohel Rahman

    Citation: Algorithms for Molecular Biology 2013 8:30

    Content type: Research

    Published on:

  47. Post-Sanger sequencing methods produce tons of data, and there is a generalagreement that the challenge to store and process them must be addressedwith data compression. In this review we first answer the ques...

    Authors: Sebastian Deorowicz and Szymon Grabowski

    Citation: Algorithms for Molecular Biology 2013 8:25

    Content type: Review Article

    Published on:

  49. Constructing species trees from multi-copy gene trees remains a challenging problem in phylogenetics. One difficulty is that the underlying genes can be incongruent due to evolutionary processes such as gene d...

    Authors: Ruchi Chaudhary, John Gordon Burleigh and David Fernández-Baca

    Citation: Algorithms for Molecular Biology 2013 8:28

    Content type: Research

    Published on:

  50. We propose three algorithms for string edit distance with duplications and contractions. These include an efficient general algorithm and two improvements which apply under certain constraints on the cost func...

    Authors: Tamar Pinhas, Shay Zakov, Dekel Tsur and Michal Ziv-Ukelson

    Citation: Algorithms for Molecular Biology 2013 8:27

    Content type: Research

    Published on:

  • ISSN: 1748-7188 (electronic)

Algorithms for Molecular Biology

ISSN: 1748-7188