JMLR: Workshop and Conference Proceedings 34:207–217, 2014 Proceedings of the 12th ICGI Induction of Directed Acyclic Word Graph in a Bioinformatics Task

First Page		Document Content
Date: 2014-08-26 06:56:50 Applied mathematics Computer science Directed acyclic word graph Deterministic finite automaton Algorithm Machine learning String searching algorithm DFA minimization Finite-state machine Automata theory Models of computation Theoretical computer science		JMLR: Workshop and Conference Proceedings 34:207–217, 2014 Proceedings of the 12th ICGI Induction of Directed Acyclic Word Graph in a Bioinformatics Task Add to Reading List Source URL: jmlr.org Download Document from Source Website File Size: 228,62 KB Share Document on Facebook

	(B) DAWG Breeds (1/3) “DAWG” (directed acyclic word graph) describes a diagram that stores a set of words in a graph (in the sense of a web of paths) that is directed (each path can only be traveled in one direction) DocID: 1nkWR - View Document
	(B) DAWG Breeds (1/3) “DAWG” (directed acyclic word graph) describes a diagram that stores a set of words in a graph (in the sense of a web of paths) that is directed (each path can only be traveled in one direction) DocID: 1ngXt - View Document
	JMLR: Workshop and Conference Proceedings 34:207–217, 2014 Proceedings of the 12th ICGI Induction of Directed Acyclic Word Graph in a Bioinformatics Task DocID: 19Lk9 - View Document
	Microsoft Word - ijita12-1.doc DocID: 18Nv3 - View Document
	The VLDB Journal DOIs00778REGULAR PAPER Trie-join: a trie-based method for efficient string similarity joins DocID: 18DZx - View Document