C4.5: programs for machine learning
C4.5: programs for machine learning
Understanding long-range correlations in DNA sequences
Proceedings of the NATO advanced research workshop and EGS topical workshop on Chaotic advection, tracer dynamics and turbulent dispersion
Complexity
Image Segmentation and Compression Using Hidden Markov Models
Image Segmentation and Compression Using Hidden Markov Models
Machine Learning
Finding recurrent sources in sequences
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
An Optimal DNA Segmentation Based on the MDL Principle
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Evolutionary segmentation of yeast genome
Proceedings of the 2004 ACM symposium on Applied computing
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
An optimal DNA segmentation based on the MDL principle
International Journal of Bioinformatics Research and Applications
Optimal segmentation using tree models
Knowledge and Information Systems
A fuzzy-driven genetic algorithm for sequence segmentation applied to genomic sequences
Applied Soft Computing
Artificial Intelligence in Medicine
Constructing comprehensive summaries of large event sequences
ACM Transactions on Knowledge Discovery from Data (TKDD)
Multivariate segmentation in the analysis of transcription tiling array data
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Recurrent predictive models for sequence segmentation
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
Evaluation of BIC and Cross Validation for model selection on sequence segmentations
International Journal of Data Mining and Bioinformatics
Hi-index | 0.00 |
Previous divide-and-conquer segmentation analyses of DNA sequences do not provide a satisfactory stopping criterion for the recursion. This paper proposes that segmentation be considered as a model selection process. Using the tools in model selection, a limit for the stopping criterion on the relaxed end can be determined. The Bayesian information criterion, in particular, provides a much more stringent stopping criterion than what is currently used. Such a stringent criterion can be used to delineate larger DNA domains. A relationship between the stopping criterion and the average domain size is empirically determined, which may aid in the determination of isochore borders.