We show that the average number of characters examined to search for r random patterns of length m in a text of length n over a uniformly distributed alphabet of size σ cannot be less than Ω(n log σ (rm)/m). When we permit up to k insertions, deletions, and/or substitutions of characters in the occurrences of the patterns, the lower bound becomes Ω(n(k+ log σ (rm))/m). This generalizes previous...

The computational program for theoretical neuroscience proposed by Marr and Poggio [1] calls for a study of biological information processing on several distinct levels of abstraction. At each of these levels — computational (defining the problems and considering possible solutions), algorithmic (specifying the sequence of operations leading to a solution) and implementational — significant pro...

Carlos Ferrer Albiach1*, José Miguel Delgado Rodríguez2, María Rot San Juan3, Prieto Martín4, Cristina Sánchez Cayuela5, Jessica Vilanova Ciscar6, Arturo Pérez-Mulas7, Luisa Ramírez Vera7, Pardo Masferrer8, Sheila Ruíz Maqueda9, Vanessa Vázquez Camello10 and Jesús Suárez Hernández11 Author Affiliations 1Radiation Oncology MD Hospital, Province of Castellón, Castelló de la Plana, Spain 2Clínica ...

M. Zavala, S. C. Herndon, R. S. Slott, E. J. Dunlea, L. C. Marr, J. H. Shorter, M. Zahniser, W. B. Knighton, T. M. Rogers, C. E. Kolb, L. T. Molina, and M. J. Molina Department of Earth, Atmospheric and Planetary Sciences, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA Center for Atmospheric and Environmental Chemistry, Aerodyne Research Inc., Billerica, Massachusetts, USA...

Recent work in automatic face recognition indicates that the major problem in modeling face processing is to find a meaningful representation for the faces. The difficulty arises from the often noted fact that human faces constitute a set of highly similar objects. Hence, a first constraint imposed upon a facial representation is that it must capture the subtle variations in features and config...