Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 10 of 10 for “"Sequence alignment (Bioinformatics)"”.

  1. Calculating the structure-based phylogenetic relationship of distantly related homologous proteins utilizing maximum likelihood structural alignment combinatorics and a novel structural molecular clock hypothesis

    … homology are generated utilizing polypeptide sequences. However, because protein structures superiorly conserve homology and contain more biochemical information than their associated protein sequences, I hypothesize that utilizing the structure of a protein instead of its sequence will …

    umkc Repository record for Calculating the structure-based phylogenetic relationship of distantly related homologous proteins utilizing maximum likelihood structural alignment combinatorics and a novel structural molecular clock hypothesis (opens in a new tab)

  2. Design and Evaluation of Two Hybrid Genome Assembly Approaches Using Illumina, Roche 454, and PacBio Datasets

    … of the most challenging and important tasks in bioinformatics. There are many different types of assembly algorithms and programs that have been developed to assemble next-generation sequencing reads. However, the assembly quality of each assembly program may vary. This paper introduces and …

    ndsu Repository record for Design and Evaluation of Two Hybrid Genome Assembly Approaches Using Illumina, Roche 454, and PacBio Datasets (opens in a new tab)

  3. Hidden Markov model-based homology search and gene prediction in NGS ERA

    … sequencing (NGS) enabled researchers to sequence a large number of organisms in order to answer various questions in biology, ecology, health, etc. For newly sequenced genomes, gene prediction and homology search against characterized protein sequence databases are two fundamental tasks …

    msu Repository record for Hidden Markov model-based homology search and gene prediction in NGS ERA (opens in a new tab)

  4. Novel computational methods for improving functional analysis for long noisy reads

    … sequencing technologies. For example, during an alignment-based homology search, insertion or deletion errors in genes will cause frameshifts, which may lead to marginal alignment scores and short alignments. In this case, it is hard to distinguish correct alignments from random alignments, and …

    msu Repository record for Novel computational methods for improving functional analysis for long noisy reads (opens in a new tab)

  5. Combinatorial optimization and application to DNA sequence analysis

    With recent and continuing advances in bioinformatics, the volume of sequence data has increased tremendously. Along with this increase, there is a growing need to develop efficient algorithms to process such data in order to make useful and important discoveries. Careful analysis of genomic data …

    gatech Repository record for Combinatorial optimization and application to DNA sequence analysis (opens in a new tab)

  6. Enhance the understanding of whole-genome evolution by designing, accelerating and parallelizing phylogenetic algorithms

    … computing society. There are many problems in Bioinformatics, such as how new functional genes arise, why genes are organized into chromosomes, how species are connected through the evolutionary tree of life, or why arrangements are subject to change. Phylogenetic analyses have become essential …

    gatech Repository record for Enhance the understanding of whole-genome evolution by designing, accelerating and parallelizing phylogenetic algorithms (opens in a new tab)

  7. Efficient String Algorithms with Applications in Bioinformatics

    … algorithmic problems, which have applications to Bioinformatics. After a short introduction in Chapter 1, an algorithm for genome mappability problem is presented in Chapter 2. Genome mappability is a measure for the approximate repeat structure of the genome with respect to substrings of specific …

    ucf Repository record for Efficient String Algorithms with Applications in Bioinformatics (opens in a new tab)

  8. Re-examining Subfamily Classifications For the Alu Family of Repeated DNA Sequences

    … data. Quentin (1988) analyzed 127 aligned Alu sequences and found evidence supporting the amplification/fixation theory in 5 subfamilies. The research presented in this thesis posits that Quentin's method of alignment used in the correspondence analysis is questionable. A reexamination using an …

    ucf Repository record for Re-examining Subfamily Classifications For the Alu Family of Repeated DNA Sequences (opens in a new tab)

  9. Scrambling analysis of ciliates

    … a brief summary of both the relevant biology and bioinformatics literature. Then, a formal definition of scrambling systems is developed which attempts to model the problem of sequence alignment between scrambled and descrambled genes. With this system, sequences can be classified into relevant …

    sask Repository record for Scrambling analysis of ciliates (opens in a new tab)