Search for Author All Reviews
	Crochemore, Maxime     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 6 reviews       Locating maximal approximate runs in a string Amit M., Crochemore M., Landau G., Sokol D. Theoretical Computer Science 700 45-62, 2017.  Type: Article Repetition and periodicity play an essential role in efficient pattern matching, data analysis, and data compression. This paper presents an efficient algorithm to identify maximal sequences of approximate repetitions within a string, ...... Jul 3 2018     External memory algorithms for string problems Roh K., Crochemore M., Iliopoulos C., Park K. Fundamenta Informaticae 84(1): 17-32, 2008.  Type: Article Modern systems typically use a cheaper external memory with a high storage capacity. Since access to this memory is relatively slow compared to the internal memory, applications that process huge amounts of data need to minimize commun...... Apr 15 2009     Algorithms on strings Crochemore M., Hancart C., Lecroq T., Cambridge University Press, New York, NY, 2007. 392 pp.  Type: Book (9780521848992) The manipulation of strings of characters is an important activity in the sciences. This book is an updated English translation of a book originally published in French in 2001. It is meant for master’s-level lect...... Apr 8 2008     Computing forbidden words of regular languages Béal M., Crochemore M., Mignosi F., Restivo A., Sciortino M. Fundamenta Informaticae 56(1,2): 121-135, 2003.  Type: Article A language is called factorial if it contains all the factors (subwords) of its words; a word x is minimal forbidden for a given language if x and all its proper factors do not belong to it. This p...... Mar 2 2004     Text algorithms Crochemore M., Rytter W., Oxford University Press, Inc., New York, NY, 1994.  Type: Book (9780195086096) The authors of this high-quality book on string matching and related topics are theoretical computer scientists. Compared to Stephen’s String searching algorithms [1], it cannot be read as fast and it contains less pra...... May 1 1996     Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy