<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">INF11303</article-id><article-id pub-id-type="doi">10.3233/INF-2000-11303</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Optimal Segmentation of Random Sequences</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Lipeika</surname><given-names>Antanas</given-names></name><email xlink:href="mailto:lipeika@ktl.mii.lt">lipeika@ktl.mii.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Institute of Mathematics and Informatics, Akademijos 4, 2600 Vilnius, Lithuania</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>2000</year></pub-date><volume>11</volume><issue>3</issue><fpage>243</fpage><lpage>256</lpage><history><date date-type="received"><day>01</day><month>07</month><year>2000</year></date></history><abstract><p>This paper deals with maximum likelihood and least square segmentation of autoregressive random sequences with abruptly changing parameters. Conditional distribution of the observations has been derived. Objective function was modified to the form suitable to apply dynamic programming method for its optimization. Expressions of Bellman functions for this case were obtained. Performance of presented approach is illustrated with simulation examples and segmentation of speech signals examples.</p></abstract><kwd-group><label>Keywords</label><kwd>optimal segmentation</kwd><kwd>maximum likelihood</kwd><kwd>least square</kwd><kwd>dynamic programming</kwd></kwd-group></article-meta></front></article>