L’avènement du génotypage à haut débit permet aujourd’hui de mieux exploiter le phénomène d’association, appelé déséquilibre de liaison (LD), qui existe entre les allèles de différents loci sur le génome. Dans ce contexte, l’utilité de certains modèles utilisés en cartographie de locus à effets quantitatifs (QTL) est remise en question. Les objectifs de ce travail étaient de discriminer entre des modèles utilisés en routine en cartographie et d’apporter des éclaircissements sur la meilleure façon d’exploiter le LD, par l’utilisation d’haplotypes, afin d’optimiser les modèles basés sur ce concept. On montre que les modèles uni-marqueur de liaison, développés en génétique il y a vingtaine d’années, comportent peu d’intérêts aujourd’hui avec le génotypage à haut débit. Dans ce contexte, on montre que les modèles uni-marqueur d’association comportent plus d’avantages que les modèles uni-marqueur de liaison, surtout pour des QTL ayant un effet petit ou modéré sur le phénotype, à condition de bien maîtriser la structure génétique entre individus. Les puissances et les robustesses statistiques de ces modèles ont été étudiées, à la fois sur le plan théorique et par simulations, afin de valider les résultats obtenus pour la comparaison de l’association avec la liaison. Toutefois, les modèles uni-marqueur ne sont pas aussi efficaces que les modèles utilisant des haplotypes dans la prise en compte du LD pour une cartographie fine de QTL. Des propriétés mathématiques reliées à la cartographie de QTL par l’exploitation du LD multiallélique capté par les modèles haplotypiques ont été explicitées et étudiées à l’aide d’une distance matricielle définie entre deux positions sur le génome. Cette distance a été exprimée algébriquement comme une fonction des coefficients du LD multiallélique. Les propriétés mathématiques liées à cette fonction montrent qu’il est difficile de bien exploiter le LD multiallélique, pour un génotypage à haut débit, si l’on ne tient pas compte uniquement de la similarité totale entre des haplotypes. Des études sur données réelles et simulées ont illustré ces propriétés et montrent une corrélation supérieure à 0.9 entre une statistique basée sur la distance matricielle et des résultats de cartographie. Cette forte corrélation a donné lieu à la proposition d’une méthode, basée sur la distance matricielle, qui aide à discriminer entre les modèles utilisés en cartographie. / The advent of high-throughput genotyping nowadays allows better exploitation of the association phenomenon, called linkage disequilibrium (LD), between alleles of different loci on the genome. In this context, the usefulness of some models to fine map quantitative trait locus (QTL) is questioned. The aims of this work were to discriminate between models routinely used for QTL mapping and to provide enlightenment on the best way to exploit LD, when using haplotypes, in order to optimize haplotype-based models. We show that single-marker linkage models, developed twenty years ago, have little interest today with the advent of high-throughput genotyping. In this context, we show that single-marker association models are more advantageous than single-marker linkage models, especially for QTL with a small or moderate effect on the phenotype. The statistical powers and robustness of these models have been studied both theoretically and by simulations, in order to validate the comparison of single-marker association models with single-marker linkage models. However, single-marker models are less efficient than haplotype-based models for making better use of LD in fine mapping of QTL. Mathematical properties related to the multiallelic LD captured by haplotype-based models have been shown, and studied, by the use of a matrix distance defined between two loci on the genome. This distance has been expressed algebraically as a function of the multiallelic LD coefficients. The mathematical properties related to this function show that it is difficult to exploit well multiallelic LD, for a high-throughput genotyping, if one takes into account the partial and total similarity between haplotypes instead of the total similarity only. Studies on real and simulated data illustrate these properties and show a correlation above 0.9 between a statistic based on the matrix distance and mapping results. Hence a new method, based on the matrix distance, which helps to discriminate between models used for mapping is proposed.

Compressed sensing has been proposed as a computationally efficient method to estimate the finite-dimensional signals. The idea is to develop an undersampling operator that can sample the large but finite-dimensional sparse signals with a rate much below the required Nyquist rate. In other words, considering the sparsity level of the signal, the compressed sensing samples the signal with a rate proportional to the amount of information hidden in the signal. In this dissertation, first, we employ compressed sensing for physical layer signal processing of directional millimeter-wave communication. Second, we go through the theoretical aspect of compressed sensing by running a comprehensive theoretical analysis of compressed sensing to address two main unsolved problems, (1) continuous-extension compressed sensing in locally convex space and (2) computing the optimum subspace and its dimension using the idea of equivalent topologies using Köthe sequence. In the first part of this thesis, we employ compressed sensing to address various problems in directional millimeter-wave communication. In particular, we are focusing on stochastic characteristics of the underlying channel to characterize, detect, estimate, and track angular parameters of doubly directional millimeter-wave communication. For this purpose, we employ compressed sensing in combination with other stochastic methods such as Correlation Matrix Distance (CMD), spectral overlap, autoregressive process, and Fuzzy entropy to (1) study the (non) stationary behavior of the channel and (2) estimate and track channel parameters. This class of applications is finite-dimensional signals. Compressed sensing demonstrates great capability in sampling finite-dimensional signals. Nevertheless, it does not show the same performance sampling the semi-infinite and infinite-dimensional signals. The second part of the thesis is more theoretical works on compressed sensing toward application. In chapter 4, we leverage the group Fourier theory and the stochastical nature of the directional communication to introduce families of the linear and quadratic family of displacement operators that track the join-distribution signals by mapping the old coordinates to the predicted new coordinates. We have shown that the continuous linear time-variant millimeter-wave channel can be represented as the product of channel Wigner distribution and doubly directional channel. We notice that the localization operators in the given model are non-associative structures. The structure of the linear and quadratic localization operator considering group and quasi-group are studied thoroughly. In the last two chapters, we propose continuous compressed sensing to address infinite-dimensional signals and apply the developed methods to a variety of applications. In chapter 5, we extend Hilbert-Schmidt integral operator to the Compressed Sensing Hilbert-Schmidt integral operator through the Kolmogorov conditional extension theorem. Two solutions for the Compressed Sensing Hilbert Schmidt integral operator have been proposed, (1) through Mercer's theorem and (2) through Green's theorem. We call the solution space the Compressed Sensing Karhunen-Loéve Expansion (CS-KLE) because of its deep relation to the conventional Karhunen-Loéve Expansion (KLE). The closed relation between CS-KLE and KLE is studied in the Hilbert space, with some additional structures inherited from the Banach space. We examine CS-KLE through a variety of finite-dimensional and infinite-dimensional compressible vector spaces. Chapter 6 proposes a theoretical framework to study the uniform convergence of a compressible vector space by formulating the compressed sensing in locally convex Hausdorff space, also known as Fréchet space. We examine the existence of an optimum subspace comprehensively and propose a method to compute the optimum subspace of both finite-dimensional and infinite-dimensional compressible topological vector spaces. To the author's best knowledge, we are the first group that proposes continuous compressed sensing that does not require any information about the local infinite-dimensional fluctuations of the signal.