Dynamic Programming Inference of Markov Networks from Finite Sets of Sample Strings

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-8, Issue 4, 1986, Pages 491-501

  Thomason, Michael G ^a   Granum, Erik ^b  

^a UNIVERSITY OF TENNESSEE   (United States)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

Banded chromosomes; dynamic programming; entropy; inference; landmark substrings; Markov network; Patterned analysis; unsupervised learning

Indexed keywords

MATHEMATICAL PROGRAMMING, DYNAMIC; MATHEMATICAL STATISTICS - RANDOM NUMBER GENERATION; PATTERN RECOGNITION; PROBABILITY;

BANDED CHROMOSOMES; ENTROPY; LANDMARK SUBSTRINGS; MARKOV NETWORK; UNSUPERVISED LEARNING;

GENETIC ENGINEERING;

EID: 0022755259     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1986.4767813     Document Type: Article

References (17)

1. N. Abramson, Informzation Theory atnd Cooding. New York: Mc-Graw-Hill, 1963.
2. T. W. Anderson and L. A. Goodman, “Statistical inference about Markov chains,” Ann. Math. Stat., vol. 28, pp. 89109, 1957.
3. R. Ash, Information Theorv. New York: Interscience, 1965.
4. L. E. Baum, “An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes,” Inequalities-Ill, pp. 18, 1972.
5. L. E. Baum and T. Petrie, Statistical inference for probabilistic functions of finite state Markov chains,” Ann. Math. Stat., vol. 37, pp. 15591563, 1966.
6. K. S. Fu, Syntactic Pattern Recognition and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
7. R. C. Gonzalez and M. G. Thomason, Syntactic Pattern Recognition: An Introduction. Reading, MA: Addison-Wesley, 1978.
8. G. H. Graniund, “Identification of human ehromosomes by using integrated density profiles.” IFFE Trans. Biomed. Eng., vol. BME-23, pp. 182192, 1976.
9. E. Granum, “Application of statistical and syntactical methods of analysis and classification to chromosome data,” in Pattern Recognition Theory and Applications. NATO ASI (Oxford, 1981), J. Kittler, K. S. Fu, and L. F. Pau, Eds. Dordrecht, Holland: D. Reidel. 1982.
10. E. Granum, “Pattern recognition aspects of chromosome analysisComputerized and visual interpretation of banded human chromosomes,” Ph.D. dissertation, Electron. Lab., Technical Univ. Denmark, Lyngby, 1980.
11. J. G. Kemeny and J. L. Snell, Finite Markov Chains. New York: Springer-Verlag, 1972.
12. S. E. Levinson, L. R. Rabiner, and M. M. Sondhi, “An introduction to the application of the theory of probabilistic functions of a Markov process in automatic speech recognition,” Bell. Syst. Tech. J., vol. 62, pp. 10351074, 1983.
13. C. Lundsteen, J. Philip, and E. Granum, “Quantitative analysis of 6985 digitized trypsin G-banded human metaphase chromosomes,” Clinical Genetics, vol. 18, pp. 355370, 1980.
14. E. Parzen, Stochastic Processes. San Francisco, CA: Holden-Day, 1962.
15. I. Piper, E. Granum, D. Rutovitz, and H. Ruttledge, “Automation of chromosome analysis,” Signal Processing, vol. 2, pp. 203221, 1980.
16. D. Sank-off and J. B. Kruskal, Eds., Time Warps, String F.dits, and Macromolecules: The Theory and Practice of Sequence Comparisons. Reading, MA: Addison-Wesley, 1983.
17. R. A. Wagner and M. J. Fischer, “The string-to-string correction problem,” J. ACM, vol. 21, pp. 168173, 1974.