A disagreement count scheme for inference of constrained markov networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1147, Issue , 1996, Pages 169-178

  Gregor, J ^a   Thomason, M G ^a  

^a University of Tennessee Knoxville   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMOSOMES; COMPUTATIONAL GRAMMARS; COST FUNCTIONS; INTEGER PROGRAMMING; MARKOV PROCESSES; PATTERN RECOGNITION;

FINITE ALPHABET; FINITE-LENGTH SEQUENCE; FREQUENCY COUNTS; HUMAN CHROMOSOMES; LOW PROBABILITY; MARKOV NETWORKS; PATTERN ANALYSIS AND RECOGNITION; STRING ALIGNMENT;

DYNAMIC PROGRAMMING;

EID: 84958959441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0033352     Document Type: Conference Paper

References (13)

1. L. Miclet, "Grammatical inference," in Syntactic and Structural Pattern Recognition Theory and Applications (H. Bunke and A. Sanfeliu, eds.), pp. 237-290, World Scientific, 1990.
2. J. Gregor, "Data-driven inductive inference of finite-state automata," Int. J. Pattern Recogn. Artif. Intell., vol. 8, pp. 305-322, 1994.
3. M. G. Thomason and J. Gregor, "Inference of Markov chain models of sequences," Current Topics in Pattern Recognition Research, pp. 163-173, 1995.
4. M. G. Thomason and E. Granum, "Dynamic programming inference of Markov networks from finite sets of sample strings," IEEE Trans. PAMI, vol. 8, pp. 491-501, 1986.
5. H. Rulot and E. Vidal, "Modelling (sub)string-length based constraints through a grammatical inference method," in Pattern Recognition Theory and Applications (P. A. Devijver and J. Kittler, eels.), pp. 451-459, Springer-Verlag, 1987.
6. H. Rulot and E. Vidal, "An efficient algorithm for the inference of circuit-free automata," in Syntactic and Structural Pattern Recognition (G. Ferratè, T. Pavliclis, A. Sanfeliu, and H. Bunke, eds.), pp. 173-184, Springer-Verlag, 1988.
7. C. E. Guthrie, J. Gregor, and M. G. Thomason, "Constrained Markov networks for automated analysis of G-banded chromosomes," Comput. Biol. Medicine, vol. 23, pp. 105-114, 1993.
8. H. Bunke and D. Pasche, "Parsing multivalued strings and its application to image and waveform recognition," in Structural Pattern Analysis (R. Mohr, T. Pavliclis, and A. Sanfeliu, eds.), pp. 1-17, World Scientific, 1989.
9. R. A. Wagner and M. J. Fischer, "The string-to-string correction problem," J. Assoc. Comput. Mach., vol. 21, pp. 168-173, 1974.
10. D. Sankoff and J. B. Kruskal, eds., Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparisons. Addison-Wesley, 1983.
11. E. Granum, M. G. Thomason, and J. Gregor, "On the use of automatically inferred Markov networks for chromosome analysis," in Automation of Cytogenetics (C. Lundsteen and J, Piper, eds.), pp. 233-251, Springer-Verlag, 1989.
12. E. Granum and M. G. Thomason, "Automatically inferred Markov network models for classification of chromosomal band pattern structures," Cytometry, vol. 11, pp. 26-39, 1990.
13. J. Gregor and M. G. Thomason, "Hybrid pattern recognition using Markov networks," IEEE Trans. PAMI, vol. 15, pp. 651-656, 1993.