Editing Baum–Welch algorithm (section)

==History==
The Baum–Welch algorithm was named after its inventors [[Leonard E. Baum]] and [[Lloyd R. Welch]]. The algorithm and the Hidden Markov models were first described in a series of articles by Baum and his peers at the [[Institute for Defense Analyses#Center for Communications and Computing|IDA Center for Communications Research, Princeton]] in the late 1960s and early 1970s.<ref>{{cite web |last=Rabiner |first=Lawrence |title=First Hand: The Hidden Markov Model |url=http://www.ieeeghn.org/wiki/index.php/First-Hand:The_Hidden_Markov_Model |publisher=IEEE Global History Network |access-date=2 October 2013 }}</ref> One of the first major applications of HMMs was to the field of [[speech processing]].<ref>{{cite journal |last1=Jelinek |first1=Frederick |last2=Bahl |first2=Lalit R. |last3=Mercer |first3=Robert L. |title=Design of a linguistic statistical decoder for the recognition of continuous speech |journal=IEEE Transactions on Information Theory |date=May 1975 |volume=21 |issue=3 |pages=250–6 |doi=10.1109/tit.1975.1055384 }}</ref> In the 1980s, HMMs were emerging as a useful tool in the analysis of biological systems and information, and in particular [[genomics|genetic information]].<ref>{{cite journal |last1=Bishop |first1=Martin J. |last2=Thompson |first2=Elizabeth A. |title=Maximum likelihood alignment of DNA sequences |journal=Journal of Molecular Biology |date=20 July 1986 |volume=190 |issue=2 |pages=159–65 |doi=10.1016/0022-2836(86)90289-5 |pmid=3641921 }}</ref> They have since become an important tool in the probabilistic modeling of genomic sequences.<ref name="Durbin1998">{{cite book |first=Richard |last=Durbin |title=Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids |url=https://books.google.com/books?id=R5P2GlJvigQC |date=23 April 1998 |publisher=Cambridge University Press |isbn=978-0-521-62041-3 }}</ref>