Publication:143696: Difference between revisions

From MaRDI portal
Publication:143696
Created automatically from import240129110113
 
 
(No difference)

Latest revision as of 11:04, 26 April 2024

DOI10.48550/ARXIV.1501.01756zbMath1403.62044DBLPjournals/ma/CastroLCHL18arXiv1501.01756OpenAlexW1597804836WikidataQ101496321 ScholiaQ101496321MaRDI QIDQ143696

Bruno M. de Castro, Florencia Leonardi, Jonatas Cesar, Florencia Leonardi, Tábita Hünemeier, Renan B. Lemes, Bruno M. Castro

Publication date: 8 January 2015

Published in: Journal of Multivariate Analysis (Search for Journal in Brave)

Abstract: In this paper we consider the problem of segmenting $n$ aligned random sequences of equal length $m$, into a finite number of independent blocks. We propose to use a penalized maximum likelihood criterion to infer simultaneously the number of points of independence as well as the position of each one of these points. We show how to compute the estimator efficiently by means of a dynamic programming algorithm with time complexity $O(m^2n)$. We also propose another algorithm, called hierarchical algorithm, that provides an approximation to the estimator when the sample size increases and runs in time $O(mn)$. Our main theoretical result is the proof of almost sure consistency of the estimator and the convergence of the hierarchical algorithm when the sample size $n$ grows to infinity. We illustrate the convergence of these algorithms through some simulation examples and we apply the method to a real protein sequence alignment of Ebola Virus.


Full work available at URL: https://arxiv.org/abs/1501.01756





Cites Work


Related Items (3)

Uses Software




This page was built for publication: A model selection approach for multiple sequence segmentation and dimensionality reduction