Articles

Mapping sequences by parts

We present the N-map method, a pairwise and asymmetrical approach which allows us to compare sequences by taking into account evolutionary events that produce shuffled, reversed or repeated elements. Basically, t...

Authors: Gilles Didier and Carito Guziolowski

A basic analysis toolkit for biological sequences

This paper presents a software library, nicknamed BATS, for some basic sequence analysis tasks. Namely, local alignments, via approximate string matching, and global alignments, via longest common subsequence ...

Authors: Raffaele Giancarlo, Alessandro Siragusa, Enrico Siragusa and Filippo Utro

Local sequence alignments statistics: deviations from Gumbel statistics in the rare-event tail

The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the important case, where gaps are allowed. For t...

Authors: Stefan Wolfsheimer, Bernd Burghardt and Alexander K Hartmann

Consistency of the Neighbor-Net Algorithm

Neighbor-Net is a novel method for phylogenetic analysis that is currently being widely used in areas such as virology, bacteriology, and plant evolution. Given an input distance matrix, Neighbor-Net produces ...

Authors: David Bryant, Vincent Moulton and Andreas Spillner

Characteristics of predictor sets found using differential prioritization

Feature selection plays an undeniably important role in classification problems involving high dimensional datasets such as microarray datasets. For filter-based feature selection, two well-known criteria used...

Authors: Chia Huey Ooi, Madhu Chetty and Shyh Wei Teng

RNAstrand: reading direction of structured RNAs in multiple sequence alignments

Genome-wide screens for structured ncRNA genes in mammals, urochordates, and nematodes have predicted thousands of putative ncRNA genes and other structured RNA motifs. A prerequisite for their functional anno...

Authors: Kristin Reiche and Peter F Stadler

GOGOT: a method for the identification of differentially expressed fragments from cDNA-AFLP data

One-dimensional (1-D) electrophoretic data obtained using the cDNA-AFLP method have attracted great interest for the identification of differentially expressed transcript-derived fragments (TDFs). However, hig...

Authors: Koji Kadota, Ryoko Araki, Yuji Nakai and Masumi Abe

Data Mining in Bioinformatics (BIOKDD)

Authors: Mohammed J Zaki, George Karypis and Jiong Yang

A spatio-temporal mining approach towards summarizing and analyzing protein folding trajectories

Understanding the protein folding mechanism remains a grand challenge in structural biology. In the past several years, computational theories in molecular dynamics have been employed to shed light on the fold...

Authors: Hui Yang, Srinivasan Parthasarathy and Duygu Ucar

Transcriptional regulatory network discovery via multiple method integration: application to e. coli K12

Transcriptional regulatory network (TRN) discovery from one method (e.g. microarray analysis, gene ontology, phylogenic similarity) does not seem feasible due to lack of sufficient information, resulting in th...

Authors: Jingjun Sun, Kagan Tuncay, Alaa Abi Haidar, Lisa Ensman, Frank Stanley, Michael Trelinski and Peter Ortoleva

PhyloScan: identification of transcription factor binding sites using cross-species evidence

When transcription factor binding sites are known for a particular transcription factor, it is possible to construct a motif model that can be used to scan sequences for additional sites. However, few statisti...

Authors: C Steven Carmack, Lee Ann McCue, Lee A Newberg and Charles E Lawrence

Probability-based model of protein-protein interactions on biological timescales

Simulation methods can assist in describing and understanding complex networks of interacting proteins, providing fresh insights into the function and regulation of biological systems. Recent studies have inve...

Authors: Alexander L Tournier, Paul W Fitzjohn and Paul A Bates

A novel functional module detection algorithm for protein-protein interaction networks

The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically evaluate a novel clustering technique for clu...

Authors: Woochang Hwang, Young-Rae Cho, Aidong Zhang and Murali Ramanathan

Refining motifs by improving information content scores using neighborhood profile search

The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The most widely used algorithms for ...

Authors: Chandan K Reddy, Yao-Chung Weng and Hsiao-Dong Chiang

SMOTIF: efficient structured pattern and profile motif search

A structured motif allows variable length gaps between several components, where each component is a simple motif, which allows either no gaps or only fixed length gaps. The motif can either be represented as a p...

Authors: Yongqiang Zhang and Mohammed J Zaki

EXMOTIF: efficient structured motif extraction

Extracting motifs from sequences is a mainstay of bioinformatics. We look at the problem of mining structured motifs, which allow variable length gaps between simple motif components. We propose an efficient a...

Authors: Yongqiang Zhang and Mohammed J Zaki

Reconstructing protein structure from solvent exposure using tabu search

A new, promising solvent exposure measure, called half-sphere-exposure (HSE), has recently been proposed. Here, we study the reconstruction of a protein's C _α trace solely fr...

Authors: Martin Paluszewski, Thomas Hamelryck and Pawel Winter

An enhanced RNA alignment benchmark for sequence alignment programs

The performance of alignment programs is traditionally tested on sets of protein sequences, of which a reference alignment is known. Conclusions drawn from such protein benchmarks do not necessarily hold for t...

Authors: Andreas Wilm, Indra Mainz and Gerhard Steger

Computing distribution of scale independent motifs in biological sequences

The use of Chaos Game Representation (CGR) or its generalization, Universal Sequence Maps (USM), to describe the distribution of biological sequences has been found objectionable because of the fractal structu...

Authors: Jonas S Almeida and Susana Vinga

Pattern statistics on Markov chains and sensitivity to parameter estimation

In order to compute pattern statistics in computational biology a Markov model is commonly used to take into account the sequence composition. Usually its parameter must be estimated. The aim of this paper is ...

Authors: Grégory Nuel

Fast calculation of the quartet distance between trees of arbitrary degrees

A number of algorithms have been developed for calculating the quartet distance between two evolutionary trees on the same set of species. The quartet distance is the number of quartets – sub-trees induced by ...

Authors: Chris Christiansen, Thomas Mailund, Christian NS Pedersen, Martin Randers and Martin Stig Stissing

Automatic layout and visualization of biclusters

Biclustering has emerged as a powerful algorithmic tool for analyzing measurements of gene expression. A number of different methods have emerged for computing biclusters in gene expression data. Many of these...

Authors: Gregory A Grothaus, Adeel Mufti and TM Murali

A phylogenetic generalized hidden Markov model for predicting alternatively spliced exons

An important challenge in eukaryotic gene prediction is accurate identification of alternatively spliced exons. Functional transcripts can go undetected in gene expression studies when alternative splicing onl...

Authors: Jonathan E Allen and Steven L Salzberg

A combinatorial optimization approach for diverse motif finding applications

Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most frequently, motif finding applications arise ...

Authors: Elena Zaslavsky and Mona Singh

The approximability of the String Barcoding problem

The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all members of a set of given strings...

Authors: Giuseppe Lancia and Romeo Rizzi

Inverse bifurcation analysis: application to simple gene systems

Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional forward problem of determining the mapping from ...

Authors: James Lu, Heinz W Engl and Peter Schuster

P-value based visualization of codon usage data

Two important and not yet solved problems in bacterial genome research are the identification of horizontally transferred genes and the prediction of gene expression levels. Both problems can be addressed by m...

Authors: Peter Meinicke, Thomas Brodag, Wolfgang Florian Fricke and Stephan Waack

On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences

Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the generation of a phylogenetic tree...

Authors: Katharina A Lehmann, Michael Kaufmann, Stephan Steigele and Kay Nieselt

Analysis of computational approaches for motif discovery

Recently, we performed an assessment of 13 popular computational tools for discovery of transcription factor binding sites (M. Tompa, N. Li, et al., "Assessing Computational Tools for the Discovery of Transcri...

Authors: Nan Li and Martin Tompa

Decomposition of overlapping protein complexes: A graph theoretical method for analyzing static and dynamic protein associations

Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complexes, while other proteins form transient as...

Authors: Elena Zotenko, Katia S Guimarães, Raja Jothi and Teresa M Przytycka

Multiple sequence alignment with user-defined anchor points

Automated software tools for multiple alignment often fail to produce biologically meaningful results. In such situations, expert knowledge can help to improve the quality of alignments.

Authors: Burkhard Morgenstern, Sonja J Prohaska, Dirk Pöhler and Peter F Stadler

Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics

The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is known that such approaches need...

Authors: Grégory Nuel

Mining, compressing and classifying with extensible motifs

Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in the design of data compression schemes. Inf...

Authors: Alberto Apostolico, Matteo Comin and Laxmi Parida

Partition function and base pairing probabilities of RNA heterodimers

RNA has been recognized as a key player in cellular regulation in recent years. In many cases, non-coding RNAs exert their function by binding to other nucleic acids, as in the case of microRNAs and snoRNAs. T...

Authors: Stephan H Bernhart, Hakim Tafer, Ulrike Mückstein, Christoph Flamm, Peter F Stadler and Ivo L Hofacker

Finding the region of pseudo-periodic tandem repeats in biological sequences

The genomes of many species are dominated by short sequences repeated consecutively. It is estimated that over 10% of the human genome consists of tandemly repeated sequences. Finding repeated regions in long ...

Authors: Xiaowen Liu and Lusheng Wang

New journal: Algorithms for Molecular Biology

This editorial announces Algorithms for Molecular Biology, a new online open access journal published by BioMed Central. By launching the first open access journal on algorithmic bioinformatics, we provide a foru...

Authors: Burkhard Morgenstern and Peter F Stadler