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 20 of 93 for “"Biological sequences"”.

  1. Function-based Algorithms for Biological Sequences

    … Carbondale. TITLE: FUNCTION-BASED ALGORITHMS FOR BIOLOGICAL SEQUENCES MAJOR PROFESSOR: Dr. Spyros Tragoudas Two problems at two different abstraction levels of computational biology are studied. At the molecular level, efficient pattern matching algorithms in DNA sequences are presented. For gene …

    siu-theses Repository record for Function-based Algorithms for Biological Sequences (opens in a new tab)

  2. Searching, clustering and evaluating biological sequences

    The latest generation of biological sequencing technologies have made it possible to generate sequence data faster and cheaper than ever before. The growth of sequence data has been exponential, and so far, has outpaced the rate of improvement of computer speed and capacity. This rate of growth, …

    maryland Repository record for Searching, clustering and evaluating biological sequences (opens in a new tab)

  3. Compressed indexing data structures for biological sequences

    … generated in the text format from sources like biological research and the internet, the problem of storing and searching within text collections (a.k.a. text indexing) becomes more and more important. This thesis introduces three different indexing data structures which focus on utilizing the …

    nus Repository record for Compressed indexing data structures for biological sequences (opens in a new tab) Download file for Compressed indexing data structures for biological sequences (opens in a new tab)

  4. Management of biological sequences using suffix trees

    The amount of available biological sequences, represented as strings over the DNA and protein alphabets, grows at phenomenal rate. Supporting various search tasks over such data efficiently requires development of sophisticated indexing techniques. Recently, suffix tree (ST) and suffix array (SA) …

    concordia Download PDF for Management of biological sequences using suffix trees (opens in a new tab)

  5. Toward Structural and Functional Predictions from Biological Sequences

    Biological sequences, including DNA and protein sequences, are believed to encode sufficient information to determine the structure and function of biological molecules, which in turn decide the phenotypic traits of animals. Deciphering the biological sequences is an important and multiscale …

    utswmed Repository record for Toward Structural and Functional Predictions from Biological Sequences (opens in a new tab)

  6. Computational modelling, simulation, and prediction of biological sequences

    … and machine learning, to analyze nucleotide sequences and make inferences from short- and long-read sequencing data. The tools and pipelines presented are publicly available in the service of the broader research community. As a soaring sequencing technology, long-read sequencing, represented …

    ubc Repository record for Computational modelling, simulation, and prediction of biological sequences (opens in a new tab) Download PDF for Computational modelling, simulation, and prediction of biological sequences (opens in a new tab)

  7. Finding conserved patterns in biological sequences, networks and genomes

    Biological patterns are widely used for identifying biologically interesting regions within macromolecules, classifying biological objects, predicting functions and studying evolution. Good pattern finding algorithms will help biologists to formulate and validate hypotheses in an attempt to obtain …

    tamu Repository record for Finding conserved patterns in biological sequences, networks and genomes (opens in a new tab)

  8. ModuleInducer: Automating the Extraction of Knowledge from Biological Sequences

    … sequencing, digitalization and collection of the biological data. However the bottleneck remains at the point of analysis and extraction of patterns from the data. We have developed a method that is aimed at widening this bottleneck by automating the knowledge extraction from the biological data. …

    ottawa-retro Repository record for ModuleInducer: Automating the Extraction of Knowledge from Biological Sequences (opens in a new tab)

  9. Entropy Measurements and Ball Cover Construction for Biological Sequences

    … is making it easier to select or engineer DNA sequences that produce dangerous proteins, it is important to be able to predict whether a novel DNA sequence is potentially dangerous by determining its taxonomic identity and functional characteristics. These tasks can be facilitated by the ever …

    vt Repository record for Entropy Measurements and Ball Cover Construction for Biological Sequences (opens in a new tab)

  10. Application of multivariate tensor-based orthogonal polynomials to biological sequences

    … sequence-phenotype relationships in other biological systems. Furthermore, a command line tool has been developed to compute orthogonal polynomials for sequence data and project corresponding phenotypes onto this space. This tool can be widely used in conjunction with experimental …

    ttu Repository record for Application of multivariate tensor-based orthogonal polynomials to biological sequences (opens in a new tab)

  11. Using sequence similarity to predict the function of biological sequences

    … of software that predicts the function of biological sequences using sequence similarity. There is a pressing need for high throughput software that can annotate protein or DNA sequences with functional information due to the exponential growth in sequence data. In Chapter 1 we briefly …

    adelaide Repository record for Using sequence similarity to predict the function of biological sequences (opens in a new tab)

  12. POLYA: A TOOL FOR ADJUDICATING COMPETING ANNOTATIONS OF BIOLOGICAL SEQUENCES

    Annotation of a biological sequence is usually performed by aligning that sequence to a database of known sequence elements. When that database contains elements that are highly similar to each other, the proper annotation may be ambiguous, because several entries in the database produce …

    montana Repository record for POLYA: A TOOL FOR ADJUDICATING COMPETING ANNOTATIONS OF BIOLOGICAL SEQUENCES (opens in a new tab)

  13. POLYA: A TOOL FOR ADJUDICATING COMPETING ANNOTATIONS OF BIOLOGICAL SEQUENCES

    Annotation of a biological sequence is usually performed by aligning that sequence to a database of known sequence elements. When that database contains elements that are highly similar to each other, the proper annotation may be ambiguous, because several entries in the database produce …

    montana-tech Repository record for POLYA: A TOOL FOR ADJUDICATING COMPETING ANNOTATIONS OF BIOLOGICAL SEQUENCES (opens in a new tab)

  14. Inexact Mapping of Short Biological Sequences in High Performance Computational Environments

    La bioinformática es la aplicación de las ciencias computacionales a la gestión y análisis de datos biológicos. A partir de 2005, con la aparición de los secuenciadores de ADN de nueva generación surge lo que se conoce como Next Generation Sequencing o NGS. Un único experimento biológico puesto en …

    upv Repository record for Inexact Mapping of Short Biological Sequences in High Performance Computational Environments (opens in a new tab)

  15. Mining non-contiguous mutation chain in biological sequences based on 3D-structure

    … this work was restricted to mining contiguous subsequences of mutations, not taking into account the practical 3D-structure of the protein. In this thesis, we generalize the definition for mutation chain to allow for mining of non-contiguous mutations. We design an efficient algorithm, termed …

    nus Repository record for Mining non-contiguous mutation chain in biological sequences based on 3D-structure (opens in a new tab) Download file for Mining non-contiguous mutation chain in biological sequences based on 3D-structure (opens in a new tab)

  16. Algorithmic Problems in Strings with Applications to the Analysis of Biological Sequences

    … biology have dramatically changed the way<br/>biological data analysis is performed [119, 92]. Next-Generation Sequenc-<br/>ing (NGS) technologies produce high-throughput data of highly controlled<br/>quality, hundreds of times faster and cheaper than a decade ago.<br/>Mapping of short reads to …

    kings Repository record for Algorithmic Problems in Strings with Applications to the Analysis of Biological Sequences (opens in a new tab) Download PDF for Algorithmic Problems in Strings with Applications to the Analysis of Biological Sequences (opens in a new tab)

  17. Efficient parallel algorithms for error correction and transcriptome assembly of biological sequences

    Next-generation sequencing technologies have led to a big data age in biology. Since the sequencing of the human genome, the primary bottleneck has steadily moved from collection to storage and analysis of the data. The primary contributions of this dissertation are design and implementation of …

    gatech Repository record for Efficient parallel algorithms for error correction and transcriptome assembly of biological sequences (opens in a new tab)

  18. Application of heuristic methods in finding patterns common to groups of biological sequences.

    … motifs in a group of functionally related biological sequences (DNA/RNA or proteins) has a specific biological function. Determination of compact groups of these common patterns is a prerequisite for their efficient modeling. However, this problem is a great challenge because of its …

    nus Repository record for Application of heuristic methods in finding patterns common to groups of biological sequences. (opens in a new tab) Download file for Application of heuristic methods in finding patterns common to groups of biological sequences. (opens in a new tab)

Page 1 of 5