Algorithms

Research

21 pages, 1400 KiB

Open AccessArticle

Analytic Combinatorics for Computing Seeding Probabilities

by Guillaume J. Filion

Algorithms 2018, 11(1), 3; https://doi.org/10.3390/a11010003 - 10 Jan 2018

Cited by 2 | Viewed by 5361 | Correction

Seeding heuristics are the most widely used strategies to speed up sequence alignment in bioinformatics. Such strategies are most successful if they are calibrated, so that the speed-versus-accuracy trade-off can be properly tuned. In the widely used case of read mapping, it has [...] Read more.

Seeding heuristics are the most widely used strategies to speed up sequence alignment in bioinformatics. Such strategies are most successful if they are calibrated, so that the speed-versus-accuracy trade-off can be properly tuned. In the widely used case of read mapping, it has been so far impossible to predict the success rate of competing seeding strategies for lack of a theoretical framework. Here, we present an approach to estimate such quantities based on the theory of analytic combinatorics. The strategy is to specify a combinatorial construction of reads where the seeding heuristic fails, translate this specification into a generating function using formal rules, and finally extract the probabilities of interest from the singularities of the generating function. The generating function can also be used to set up a simple recurrence to compute the probabilities with greater precision. We use this approach to construct simple estimators of the success rate of the seeding heuristic under different types of sequencing errors, and we show that the estimates are accurate in practical situations. More generally, this work shows novel strategies based on analytic combinatorics to compute probabilities of interest in bioinformatics. Full article

(This article belongs to the Special Issue Bioinformatics Algorithms and Applications)

► Show Figures

Figure 1

789 KiB

Open AccessArticle

A Hierarchical Multi-Label Classification Algorithm for Gene Function Prediction

by Shou Feng, Ping Fu and Wenbin Zheng

Algorithms 2017, 10(4), 138; https://doi.org/10.3390/a10040138 - 08 Dec 2017

Cited by 14 | Viewed by 6004

Abstract

Gene function prediction is a complicated and challenging hierarchical multi-label classification (HMC) task, in which genes may have many functions at the same time and these functions are organized in a hierarchy. This paper proposed a novel HMC algorithm for solving this problem [...] Read more.

Gene function prediction is a complicated and challenging hierarchical multi-label classification (HMC) task, in which genes may have many functions at the same time and these functions are organized in a hierarchy. This paper proposed a novel HMC algorithm for solving this problem based on the Gene Ontology (GO), the hierarchy of which is a directed acyclic graph (DAG) and is more difficult to tackle. In the proposed algorithm, the HMC task is firstly changed into a set of binary classification tasks. Then, two measures are implemented in the algorithm to enhance the HMC performance by considering the hierarchy structure during the learning procedures. Firstly, negative instances selecting policy associated with the SMOTE approach are proposed to alleviate the imbalanced data set problem. Secondly, a nodes interaction method is introduced to combine the results of binary classifiers. It can guarantee that the predictions are consistent with the hierarchy constraint. The experiments on eight benchmark yeast data sets annotated by the Gene Ontology show the promising performance of the proposed algorithm compared with other state-of-the-art algorithms. Full article

(This article belongs to the Special Issue Bioinformatics Algorithms and Applications)

► Show Figures

Figure 1

1380 KiB

Open AccessArticle

Detecting Composite Functional Module in miRNA Regulation and mRNA Interaction Network

by Yi Yang and Chu Pan

Algorithms 2017, 10(4), 136; https://doi.org/10.3390/a10040136 - 05 Dec 2017

Viewed by 4793

Abstract

The detection of composite miRNA functional module (CMFM) is of tremendous significance and helps in understanding the organization, regulation and execution of cell processes in cancer, but how to identify functional CMFMs is still a computational challenge. In this paper we propose a [...] Read more.

The detection of composite miRNA functional module (CMFM) is of tremendous significance and helps in understanding the organization, regulation and execution of cell processes in cancer, but how to identify functional CMFMs is still a computational challenge. In this paper we propose a novel module detection method called MBCFM (detecting Composite Function Modules based on Maximal Biclique enumeration), specifically designed to bicluster miRNAs and target messenger RNAs (mRNAs) on the basis of multiple biological interaction information and topical network features. In this method, we employ algorithm MICA to enumerate all maximal bicliques and further extract R-pairs from the miRNA-mRNA regulatory network. Compared with two existing methods, Mirsynergy and SNMNMF on ovarian cancer dataset, the proposed method of MBCFM is not only able to extract cohesiveness-preserved CMFMs but also has high efficiency in running time. More importantly, MBCFM can be applied to detect other cancer-associated miRNA functional modules. Full article

(This article belongs to the Special Issue Bioinformatics Algorithms and Applications)

► Show Figures

Figure 1

Journal Menu

Journal Browser

Bioinformatics Algorithms and Applications

Share This Special Issue

Special Issue Editor

Special Issue Information

Keywords

Published Papers (3 papers)

Research

Further Information

Guidelines

MDPI Initiatives

Follow MDPI