Finding consensus patterns in very scarce biosequence samples from their minimal multiple generalizations

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we examine the issues involved in finding consensus patterns from biosequence data of very small sample sizes, by searching for so-called minimal multiple generalization (mmg), that is, a set of syntactically minimal patterns that accounts for all the samples. The data we use are the sigma regulons with more conserved consensus patterns for the bacteria B. subtilis. By comparing between the mmgs found over different search spaces, we found that it is possible to derive patterns close to the known consensus patterns by simply making some reasonable requirements on the kinds of patterns to obtain. We also propose some simple measures to evaluate the patterns in an mmg. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Ng, Y. K., & Shinohara, T. (2006). Finding consensus patterns in very scarce biosequence samples from their minimal multiple generalizations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3918 LNAI, pp. 540–545). Springer Verlag. https://doi.org/10.1007/11731139_63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free