Sökning: "approximate matching"

Visar resultat 1 - 5 av 18 avhandlingar innehållade orden approximate matching.

  1. 1. Nonparametric Statistical Inference for Entropy-type Functionals

    Författare :David Källberg; Oleg Seleznjev; Timo Koski; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; entropy estimation; Rényi entropy; divergence estimation; quadratic density functional; U-statistics; consistency; asymptotic normality; Poisson convergence; stationary m-dependent sequence; inter-point distances; entropy maximizing distribution; two-sample problem; approximate matching; Mathematical Statistics; matematisk statistik;

    Sammanfattning : In this thesis, we study statistical inference for entropy, divergence, and related functionals of one or two probability distributions. Asymptotic properties of particular nonparametric estimators of such functionals are investigated. We consider estimation from both independent and dependent observations. LÄS MER

  3. 2. Model Order Reduction Based on Semidefinite Programming

    Författare :Aivar Sootla; Institutionen för reglerteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; model reduction; parameterized model reduction; nu-gap metric; semidefinite programming; frequency response matching.;

    Sammanfattning : The main topic of this PhD thesis is complexity reduction of linear time-invariant models. The complexity in such systems is measured by the number of differential equations forming the dynamical system. This number is called the order of the system. LÄS MER

  4. 3. Constructing Evolutionary Trees - Algorithms and Complexity

    Författare :Anna Östlin; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Maximum homeomorphic subtrees; Consensus trees; Experiment model; Evolutionary trees; Complexity; Computational biology; Algorithms; Data structures; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll; Biology; Biologi;

    Sammanfattning : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. LÄS MER

  5. 4. Methods and applications in DNA sequence alignments

    Författare :Ellen Sherwood; Karolinska Institutet; Karolinska Institutet; []
    Nyckelord :DNA sequence alignment; CNV; Chicken; Trypanosoma cruzi.;

    Sammanfattning : DNA sequence alignment is one of the most common bioinformatics tasks. Alignment analysis for eukaryotic genomes is challenging because the datasets are large. Repeat sequences also make the analysis difficult. This thesis describes new methods which we have developed for DNA sequence alignment that address these problems. LÄS MER

  7. 5. A Serendipitous Journey through Stochastic Processes

    Författare :Ludovico Theo Giorgini; John Scott Wettlaufer; Valerio Lucarini; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; teoretisk fysik; Theoretical Physics;

    Sammanfattning : In this licentiate thesis I will present some new insights in different problems in the field of stochastic processes. A stochastic resonance system is studied using path integral techniques, originally developed in quantum field theory, to recover the optimal means through which noise self-organises before a rare transition from one potential well to the other. LÄS MER