Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Segmentation by Maximal Predictive Partitioning According to Composition Biases
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2066/2001
Book
Computational Biology
DOI
10.1007/3-540-45727-5
Copyright
2001
ISBN
978-3-540-42242-6
DOI
10.1007/3-540-45727-5_4
Pages
32-44
Subject Collection
Computer Science
SpringerLink Date
Monday, January 01, 2001
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (261.3 KB)
Free Preview
Segmentation by Maximal Predictive Partitioning According to Composition Biases
Laurent Guéguen
6
(6)
CEB-LIS ― UPMC Paris VI, France
Abstract
We present a method for segmenting qualitative sequences, according to a type of composition criteria whose definition and evaluation are founded on the notion of predictors and additive prediction. Given a set of predictors, a partition of a sequence can be precisely evaluated. We present a language for the declaration of predictors. One of the problems is to optimize the partition of a sequence into a given number of segments. The other problem is to obtain a suitable number of segments for the partitioning of the sequence. We present an algorithm which, given a sequence and a set of predictors, can successively compute the optimal partitions of the sequence for growing numbers of segments. The time- and space-complexity of the algorithm are linear for the length of sequence and number of predictors. Experimentally, the computed partitions are highly stable regard to the number of segments, and we present an application of this approach to the determination of the origins of replication of bacterial chromosomes.
Laurent
Guéguen
Email:
gueguen@biomserv.univ-lyon1.fr
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.106 • Server: mpweb08
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)