Learn More
Let GF(q) be the n-dimensional vector space over the Galois field GF(q). The Hamming distance between two vectors of GF(q) is defined to be the number of coordinates in which they differ. A q-ary linear [n, k, d; q]-code is a k-dimensional linear subspace of GF(q) with minimum distance d. Let n(k, d) denote the smallest value of n for which an [n, k,(More)
Interpreting maps through the eyes of expert and novice users Kristien Ooms a , Philippe De Maeyer a , Veerle Fack b , Eva Van Assche c & Frank Witlox a a Department of Geography, Ghent University, Ghent, Belgium b Department of Applied Mathematics and Computer Science, Ghent University, Ghent, Belgium c Department of Experimental Psychology, Ghent(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)
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views(More)
A balanced incomplete block design (BIBD) [1] with parameters 2-(v, b, r, k, λ) (short 2-(v, k, λ)) is a pair (V,B) where V is a v-set (elements are called points) and B is a collection of b k-subsets (elements are called blocks) of V such that each point is contained in exactly r blocks and any pair of points is contained in exactly λ blocks. A Hadamard(More)
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)
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)
Sampling core subsets from genetic resources while maintaining as much as possible the genetic diversity of the original collection is an important but computationally complex task for gene bank managers. The Core Hunter computer program was developed as a tool to generate such subsets based on multiple genetic measures, including both distance measures and(More)