The combination of incessant advances in sequencing technology producing large amounts of data and innovative bioinformatics approaches, designed to cope with this data flood, has led to new interesting results in the life sciences. Given the magnitude of sequence data to be processed, many bioinformatics tools rely on efficient solutions to a variety of… (More)
This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will… (More)
Conventional analyses on eye movement data only take into account eye movement metrics, such as the number or the duration of fixations and length of the scanpaths, on which statistical analysis is performed for detecting significant differences. However, the spatial dimension in the eye movements is neglected, which is an essential element when… (More)
We present results on the size of the smallest maximal partial ovoids and on the size of the smallest maximal partial spreads of the generalized quadrangles W (q) and Q(4, q).
We study codewords of small weight in the codes arising from De-sarguesian projective planes. We first of all improve the results of K. Chouinard on codewords of small weight in the codes arising from P G(2, p), p prime. Chouinard characterized all the codewords up to weight 2p in these codes. Using a particular basis for this code, described by Moor-house,… (More)
We have developed essaMEM, a tool for finding maximal exact matches that can be used in genome comparison and read mapping. essaMEM enhances an existing sparse suffix array implementation with a sparse child array. Tests indicate that the enhanced algorithm for finding maximal exact matches is much faster, while maintaining the same memory footprint. In… (More)
Two methods are given for constructing total exchange algorithms for hypercubic processor networks. This is done by means of bit sequences with special properties. The algorithms are optimal with respect to a given time model, need no intermediate message buuering and are local in the sense that every processor executes basically the same program.
Before this work, at least 762 inequivalent Hadamard matrices of order 36 were known. We found 7238 Hadamard matrices of order 36 and 522 inequivalent [72, 36, 12] double-even self-dual codes which are obtained from all 2-(35, 17, 8) designs with an automorphism of order 3 and 2 fixed points and blocks.