Search for Author All Reviews
	Manea, Florin     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 1 of 1 reviews       The hardness of counting full words compatible with partial words Manea F., Tiseanu C. Journal of Computer and System Sciences 79(1): 7-22, 2013.  Type: Article Sequences of symbols from a given alphabet are known as words. If symbols are unknown at some positions, then such sequences are known as partial words. Two partial words are said to be compatible when they agree in all positions where...... Apr 22 2014
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy