Statistical Inference in Hidden Markov Models Using k-Segment Constraints

REFERENCES

• Andrews, M., and Vigliocco, G. (2010), “The Hidden Markov Topic Model: A Probabilistic Model of Semantic Representation,” Topics in Cognitive Science, 2, 101–113.
   PubMed Web of Science ®Google Scholar
• Aston, J.A., Peng, J.-Y., and Martin, D.E. (2012), “Implied Distributions in Multiple Change Point Problems,” Statistics and Computing, 22, 981–993.
   Web of Science ®Google Scholar
• Aston, J. A.D., and Martin, D. E.K. (2007), “Distributions Associated With General Runs and Patterns in Hidden Markov Models,” The Annals of Applied Statistics, 1, 585–611.
   Web of Science ®Google Scholar
• Auger, I.E., and Lawrence, C.E. (1989), “Algorithms for the Optimal Identification of Segment Neighborhoods,” Bulletin of Mathematical Biology, 51, 39–54.
   PubMed Web of Science ®Google Scholar
• Baum, L.E., and Petrie, T. (1966), “Statistical Inference for Probabilistic Functions of Finite State Markov Chains,” The Annals of Mathematical Statistics, 37, 1554–1563.
   Google Scholar
• Beroukhim, R., Mermel, C.H., Porter, D., Wei, G., Raychaudhuri, S., Donovan, J., Barretina, J., Boehm, J.S., Dobson, J., Urashima, M., Henry, K. T.M., Pinchback, R.M., Ligon, A.H., Cho, Y.-J., Haery, L., Greulich, H., Reich, M., Winckler, W., Lawrence, M.S., Weir, B.A., Tanaka, K.E., Chiang, D.Y., Bass, A.J., Loo, A., Hoffman, C., Prensner, J., Liefeld, T., Gao, Q., Yecies, D., Signoretti, S., Maher, E., Kaye, F.J., Sasaki, H., Tepper, J.E., Fletcher, J.A., Tabernero, J., Baselga, J., Tsao, M.-S., Demichelis, F., Rubin, M.A., Janne, P.A., Daly, M.J., Nucera, C., Levine, R.L., Ebert, B.L., Gabriel, S., Rustgi, A.K., Antonescu, C.R., Ladanyi, M., Letai, A., Garraway, L.A., Loda, M., Beer, D.G., True, L.D., Okamoto, A., Pomeroy, S.L., Singer, S., Golub, T.R., Lander, E.S., Getz, G., Sellers, W.R., and Meyerson, M. (2010), “The Landscape of Somatic Copy-Number Alteration Across Human Cancers,” Nature, 463, 899–905.
   PubMed Web of Science ®Google Scholar
• Blei, D.M., Ng, A.Y., and Jordan, M.I. (2003), “Latent Dirichlet Allocation,” Journal of Machine Learning Research, 3, 993–1022.
   Web of Science ®Google Scholar
• Büttcher, S., Clarke, C. L.A., and Cormack, G.V. (2010), Information Retrieval: Implementing and Evaluating Search Engines, Cambridge, MA: MIT Press.
   Google Scholar
• Carter, S.L., Cibulskis, K., Helman, E., McKenna, A., Shen, H., Zack, T., Laird, P.W., Onofrio, R.C., Winckler, W., Weir, B.A., Beroukhim, R., Pellman, D., Levine, D.A., Lander, E.S., Meyerson, M., and Getz, G. (2012), “Absolute Quantification of Somatic DNA Alterations in Human Cancer,” Nature Biotechnology, 30, 413–421.
   PubMed Web of Science ®Google Scholar
• Chen, H., Xing, H., and Zhang, N.R. (2011), “Estimation of Parent Specific DNA Copy Number in Tumors Using High-Density Genotyping Arrays,” PLoS Computational Biology, 7, e1001060.
   PubMed Web of Science ®Google Scholar
• Cowell, R.G., Dawid, P.A., Lauritzen, S.L., and Spiegelhalter, D.J. (2003), Probabilistic Networks and Expert Systems (Information Science and Statistics), New York: Springer.
   Google Scholar
• Crouse, M.S., Nowak, R.D., and Baraniuk, R.G. (1998), “Wavelet-Based Statistical Signal Processing Using Hidden Markov Models,” IEEE Transactions on Signal Processing, 46, 886–902.
   Web of Science ®Google Scholar
• Everingham, M., Gool, L., Williams, C.K., Winn, J., and Zisserman, A. (2010), “The Pascal Visual Object Classes (VOC) Challenge,” International Journal of Computer Vision, 88, 303–338.
   Web of Science ®Google Scholar
• Fearnhead, P. (2006), “Exact and Efficient Bayesian Inference for Multiple Changepoint Problems,” Statistics and Computing, 16, 203–213.
   Web of Science ®Google Scholar
• Fearnhead, P., and Liu, Z. (2007), “Online Inference for Multiple Changepoint Problems,” Journal of the Royal Statistical Society, Series B, 69, 589–605.
   Google Scholar
• Frick, K., Munk, A., and Sieling, H. (2014), “Multiscale Change-Point Infere-nce,” Journal of the Royal Statistical Society, Series B, 76, 495–580.
   Google Scholar
• Fu, J., and Koutras, M. (1994), “Distribution Theory of Runs: A Markov Chain Approach,” Journal of the American Statistical Association, 89, 1050–1058.
   Web of Science ®Google Scholar
• Greenman, C.D., Bignell, G., Butler, A., Edkins, S., Hinton, J., Beare, D., Swamy, S., Santarius, T., Chen, L., Widaa, S., Futreal, P.A., and Stratton, M.R. (2010), “PICNIC: An Algorithm to Predict Absolute Allelic Copy Number Variation With Microarray Cancer Data,” Biostatistics, 11, 164–175.
   PubMed Web of Science ®Google Scholar
• Gruber, A., Weiss, Y., and Rosen-Zvi, M. (2007), “Hidden Topic Markov Models,” Journal of Machine Learning Research—Proceedings Track, 2, 163–170.
   Google Scholar
• Hofmann, T. (2001), “Unsupervised Learning by Probabilistic Latent Semantic Analysis,” Machine Learning, 42, 177–196.
   Web of Science ®Google Scholar
• Killick, R., Fearnhead, P., and Eckley, I.A. (2012), “Optimal Detection of Changepoints With a Linear Computational Cost,” Journal of the American Statistical Association, 107, 1590–1598.
   Web of Science ®Google Scholar
• Kohlmorgen, J. (2003), “On Optimal Segmentation of Sequential Data,” in IEEE 13th Workshop on Neural Networks for Signal Processing, NNSP’03, pp. 449–458.
   Google Scholar
• Koller, D., and Friedman, N. (2009), Probabilistic Graphical Models—Principles and Techniques, Cambridge, MA: MIT Press.
   Google Scholar
• Li, A., Liu, Z., Lezon-Geyda, K., Sarkar, S., Lannin, D., Schulz, V., Krop, I., Winer, E., Harris, L., and Tuck, D. (2011), “GPHMM: An Integrated Hidden Markov Model for Identification of Copy Number Alteration and Loss of Heterozygosity in Complex Tumor Samples Using Whole Genome Snp Arrays,” Nucleic Acids Research, 39, 4928–4941.
   PubMed Web of Science ®Google Scholar
• Li, N., and Stephens, M. (2003), “Modeling Linkage Disequilibrium and Identifying Recombination Hotspots Using Single-Nucleotide Polymorphism Data,” Genetics, 165, 2213–2233.
   PubMed Web of Science ®Google Scholar
• Loo, P.V., Nordgard, S.H., Lingjærde, O.C., Russnes, H.G., Rye, I.H., Sun, W., Weigman, V.J., Marynen, P., Zetterberg, A., Naume, B., Perou, C.M., Børresen-Dale, A.-L., and Kristensen, V.N. (2010), “Allele-Specific Copy Number Analysis of Tumors,” Proceedings of the National Academy of Sciences of the United States of America, 107, 16910–16915.
   PubMed Web of Science ®Google Scholar
• Martin, D.E., and Aston, J.A. (2013), “Distribution of Statistics of Hidden State Sequences Through the Sum-Product Algorithm,” Methodology and Computing in Applied Probability, 15, 897–918.
   Web of Science ®Google Scholar
• Mitchell, C.D., Harper, M.P., and Jamieson, L.H. (1995), “On the Complexity of Explicit Duration HMM’s,” IEEE Transactions on Speech and Audio Processing, 3, 213–217.
   Google Scholar
• Murphy, K. (2002), “Hidden Semi-Markov Models (HSMMs),” Technical Report, University of California, Berkley, CA.
   Google Scholar
• Nam, C.F., Aston, J.A., and Johansen, A.M. (2012), “Quantifying the Uncertainty In Change Points,” Journal of Time Series Analysis, 33, 807–823.
   Web of Science ®Google Scholar
• Nilsson, D., and Goldberger, J. (2001), “Sequentially Finding the N-Best List in Hidden Markov Models,” in Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI), pp. 1280–1285.
   Google Scholar
• Olshen, A.B., Venkatraman, E.S., Lucito, R., and Wigler, M. (2004), “Circular Binary Segmentation for the Analysis of Array-Based DNA Copy Number Data,” Biostatistics, 5, 557–572.
   PubMed Web of Science ®Google Scholar
• Paas, L.J., Vermunt, J.K., and Bijmolt, T.H. (2007), “Discrete Time, Discrete State Latent Markov Modelling for Assessing and Predicting Household Acquisitions of Financial Products,” Journal of the Royal Statistical Society, Series A, 170, 955–974.
   Web of Science ®Google Scholar
• Rabiner, L.R. (1989), “A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition,” in Proceedings of the IEEE (Vol. 111), pp. 257–286.
   Google Scholar
• Schwartz, R., and Chow, Y.L. (1990), “The N-Best Algorithms: An Efficient and Exact Procedure for Finding the N Most Likely Sentence Hypotheses,” in ICASSP-90., International Conference on Acoustics, Speech, and Signal Processing (Vol. 111), pp. 81–84.
   Google Scholar
• Scott, S.L. (2002), “Bayesian Methods for Hidden Markov Models: Recursive Computing in the 21st Century,” Journal of the American Statistical Association, 97, 337–351.
   Web of Science ®Google Scholar
• Viterbi, A.J. (1967), “Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm,” IEEE Transactions on Information Theory, IT-13, 260–269.
   Web of Science ®Google Scholar
• Yau, C. (2013), “OncoSNP-SEQ: A Statistical Approach for the Identification of Somatic Copy Number Alterations From Next-Generation Sequencing of Cancer Genomes,” Bioinformatics, 29, 2482–2484.
   PubMed Web of Science ®Google Scholar
• Yau, C., and Holmes, C. (2013), “A Decision Theoretic Approach for Segmental Classification Using Hidden Markov Models,” Annals of Applied Statistics, 7, 1814–1835.
   Web of Science ®Google Scholar
• Yau, C., Mouradov, D., Jorissen, R.N., Colella, S., Mirza, G., Steers, G., Harris, A., Ragoussis, J., Sieber, O., and Holmes, C.C. (2010), “A Statistical Approach for Detecting Genomic Aberrations in Heterogeneous Tumor Samples From Single Nucleotide Polymorphism Genotyping Data,” Genome Biology, 11, R92.
   PubMed Web of Science ®Google Scholar
• Yu, S.-Z. (2010), “Hidden Semi-Markov Models,” Artificial Intelligence, 174, 215–243.
   Web of Science ®Google Scholar