ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computers & Chemistry
Volume 20, Issue 1, March 1996, Pages 3-23
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (2146 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0097-8485(96)80003-9    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1996 Published by Elsevier Science Ltd. All rights reserved.

A flexible motif search technique based on generalized profiles

Philipp Buchera, Corresponding Author Contact Information, Kevin Karplusb, Nicolas Moeric and Kay Hofmanna

a Swiss Institute for Experimental Cancer Research, CH-1066 Epalinges, Switzerland b Computer Engineering, University of California, Santa Cruz, Santa Cruz, CA 95064, U.S.A. c Département de mathématiques, École Polytechnique Fédérale, CH-1015 Lausanne, Switzerland

Received 18 November 1994; 
revised 12 July 1995. 
Available online 24 May 2002.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

A flexible motif search technique is presented which has two major components: (1) a generalized profile syntax serving as a motif definition language; and (2) a motif search method specifically adapted to the problem of finding multiple instances of a motif in the same sequence. The new profile structure, which is the core of the generalized profile syntax, combines the functions of a variety of motif descriptors implemented in other methods, including regular expression-like patterns, weight matrices, previously used profiles, and certain types of hidden Markov models (HMMs). The relationship between generalized profiles and other biomolecular motif descriptors is analyzed in detail, with special attention to HMMs. Generalized profiles are shown to be equivalent to a particular class of HMMs, and conversion procedures in both directions are given. The conversion procedures provide an interpretation for local alignment in the framework of stochastic models, allowing for clear, simple significance tests. A mathematical statement of the motif search problem defines the new method exactly without linking it to a specific algorithmic solution. Part of the definition includes a new definition of disjointness of alignments.

Article Outline

• References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.