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 50 for “"de Bruijn graph"”.

  1. Covering the de Bruijn graph

    … of binary n-tuples also give rise to a special graph called the de Bruijn graph B . The de Bruijn graph is a directed graph with 2n nodes. Each node has 2 arcs entering it and 2 arcs going out of it. Thus, there are a total of 2n+1 arcs in Bn. In this thesis, we define a cover of the de Bruijn …

    nps Repository record for Covering the de Bruijn graph (opens in a new tab)

  2. Comparative Genomics Using the Colored de Bruijn Graph

    … manner is a difficult problem. Methods that provide the highest resolution are too inefficient and methods that are efficient are too low resolution. In this thesis, we show that the Colored de Bruijn Graph (CdBG) is a suitable method for comparing genomes because it is efficient while maintaining …

    byu Repository record for Comparative Genomics Using the Colored de Bruijn Graph (opens in a new tab) Download PDF for Comparative Genomics Using the Colored de Bruijn Graph (opens in a new tab)

  3. Optical MANs based on the de Bruijn graph.

    … studies multihop lightwave networks based on the de Bruijn Graph (dBG) and their hierarchical structures. Routing algorithms that take advantage of the inherent structure of the network are studied. Three new algorithms that would progressively improve on the mean path length performance are …

    ottawa-retro Repository record for Optical MANs based on the de Bruijn graph. (opens in a new tab)

  4. Efficient Synergistic De Novo Co-Assembly Of Bacterial Genomes From Single Cells Using Colored De Bruijn Graph

    … multiple displacement amplification (MDA), has made it possible to sequence and assemble bacterial genomes from a single cell. However, the quality of single cell genome assembly has not yet reached the quality of normal multi-cell genome assembly due to the coverage bias (including uneven depth …

    wayne-thes Repository record for Efficient Synergistic De Novo Co-Assembly Of Bacterial Genomes From Single Cells Using Colored De Bruijn Graph (opens in a new tab)

  5. Discovering genetic variation in populations using next generation sequencing and de novo assembly

    <p>The de Bruijn Graph is a simple and efficient data structure that is used in many areas of sequence analysis including genome assembly, sequencing error correction, sequencing read compression and variant discovery. The data structure has a single parameter k, is straightforward to implement and …

    oxford Repository record for Discovering genetic variation in populations using next generation sequencing and de novo assembly (opens in a new tab)

  6. Scaling short read de novo DNA sequence assembly to gigabase genomes

    … sparking a revolution in whole genome de novo sequencing. However, these new technologies sample much shorter segments of DNA, called short reads, than conventional but more costly long read sequencing technologies, and suffer from higher and more varied error rates. Modern genome …

    uiuc Repository record for Scaling short read de novo DNA sequence assembly to gigabase genomes (opens in a new tab)

  7. Algorithms for Multisample Reads Binning

    … a serious computational challenge. The development of genome-independent methods is essential because of the lack of trusted reference genomes that can be used to guide the assembly process. The predominant assembly formalism used for short-read datasets is the de Bruijn graph. In a de …

    uconn-diss Repository record for Algorithms for Multisample Reads Binning (opens in a new tab)

  8. Parallel and External-Memory Algorithms for Large-Scale Genomic Sequence-Graph and -Index Construction

    Rapid developments in the throughput and affordability of modern genome-sequencing technologies have made the generation of billions of sequencing reads from biological samples highly time- and cost-efficient. Concurrent development of efficient algorithms and tools for genome assembly have also …

    maryland Repository record for Parallel and External-Memory Algorithms for Large-Scale Genomic Sequence-Graph and -Index Construction (opens in a new tab)

  9. A Novel Assembly Algorithm That Optimizes For RNA-Seq Data

    … sequencing (NGS) technology has shown unprecedented promise for accurately identifying and quantifying genomic variants for living organisms. For species whose genome sequences are unknown, the first step of RNA sequencing data analysis is to assemble all short reads. The de Bruijn graph-based …

    nodak Repository record for A Novel Assembly Algorithm That Optimizes For RNA-Seq Data (opens in a new tab)

  10. Approaches to scaling and improving metagenome sequence assembly

    … sequencing technologies have been developed that produce more DNA sequence reads at a much lower cost. Because of this, large quantities of data have been generated that are difficult to analyze computationally, not only because of the sheer number of reads but due to errors. One …

    msu Repository record for Approaches to scaling and improving metagenome sequence assembly (opens in a new tab)

  11. A Parameterization Study of Short Read Assembly Using the Velvet Assembler

    … large, contiguous sections of genetic code from short reads generated from laboratory techniques. We explore the Eulerian Path approach in detail, utilizing a de Bruijn Graph, and demonstrate current software technologies and algorithms using a sample genome. We investigate the input …

    usm Repository record for A Parameterization Study of Short Read Assembly Using the Velvet Assembler (opens in a new tab)

  12. Computational Methods for the Analysis of Mitochondrial Genomes

    Much of our understanding of eukaryotic life has come from studying mitochondrial DNA, giving rise to leading hypotheses in evolution. To enable these studies, efficient algorithms are needed to interpret, analyze, and draw relevant conclusions from the available mitochondrial sequence data. The …

    qucosa-diss

  13. Scalable methods for improving genome assemblies

    De novo genome assembly is cornerstone to modern genomics studies. It is also a useful method for studying genomes with high variation, such as cancer genomes, as it is not biased by a reference. De novo short-read assemblers commonly use de Bruijn graphs, where nodes are sequences of equal length …

    ubc Repository record for Scalable methods for improving genome assemblies (opens in a new tab) Download PDF for Scalable methods for improving genome assemblies (opens in a new tab)

  14. De Novo Genome Assembly Using Paired-end Short Reads

    Many de novo genome assemblers have been proposed recently. The basis for most existing methods relies on the de bruijn graph: a complex graph structure that attempts to encompass the entire genome. Such graphs can be prohibitively large, may fail to capture subtle information and is difficult to …

    nus Repository record for De Novo Genome Assembly Using Paired-end Short Reads (opens in a new tab) Download file for De Novo Genome Assembly Using Paired-end Short Reads (opens in a new tab)

  15. Improving Peptide Identification in Proteomics Data Analysis through Repeat-Preserving Decoy and Decoy-Free Retraining

    Accurately identifying peptides in proteomics is central to understanding the complexities of biological systems. Despite the advancements in proteomics data analysis, challenges related to False Discovery Rate (FDR) estimation and peptide identification persist. This thesis offers two novel …

    waterloo Repository record for Improving Peptide Identification in Proteomics Data Analysis through Repeat-Preserving Decoy and Decoy-Free Retraining (opens in a new tab)

  16. On the chromatic number of the <em>AO</em>(2, <em>k </em>, <em>k</em>-1) graphs.

    The alphabet overlap graph is a modification of the well known de Bruijn graph. De Bruijn graphs have been highly studied and hence many properties of these graphs have been determined. However, very little is known about alphabet overlap graphs. In this work we determine the chromatic number for a …

    etsu Repository record for On the chromatic number of the <em>AO</em>(2, <em>k </em>, <em>k</em>-1) graphs. (opens in a new tab) Download PDF for On the chromatic number of the <em>AO</em>(2, <em>k </em>, <em>k</em>-1) graphs. (opens in a new tab)

  17. RNA-Bloom : de novo RNA-seq assembly with Bloom filters

    … Without bias from a reference sequence, de novo RNA-seq assembly is particularly useful for building new reference transcriptomes, detecting fusion genes, and discovering novel spliced transcripts. This is a challenging problem, and to address it at least eight approaches, including …

    ubc Repository record for RNA-Bloom : de novo RNA-seq assembly with Bloom filters (opens in a new tab) Download PDF for RNA-Bloom : de novo RNA-seq assembly with Bloom filters (opens in a new tab)

  18. Efficient String Graph Construction Algorithm

    … research where assemblers are dominated by de Bruijn graph-based approaches, string graph-based assembly approach is getting more attention because of its ability to losslessly retain information from sequence data. Despite the advantages provided by a string graph in repeat detection and in …

    ucf Repository record for Efficient String Graph Construction Algorithm (opens in a new tab)

  19. Efficient analysis of microbial whole-genome sequence data using de Bruijn graphs

    … potential to dramatically improve our ability to detect, understand, and monitor AMR. However, microbial diversity and complexity means that the analysis and interpretation of their genomes is challenging. In this thesis, I explore applications of de Bruijn graphs (DBGs) to the analysis of these …

    oxford Repository record for Efficient analysis of microbial whole-genome sequence data using de Bruijn graphs (opens in a new tab)

  20. Large Genomes Assembly Using MAPREDUCE Framework

    … of an organism is the essential step toward understanding its genomic and genetic characteristics. Currently, whole genome shotgun (WGS) sequencing is the most widely used genome sequencing technique to determine the entire DNA sequence of an organism. Recent advances in next-generation …

    clemson Repository record for Large Genomes Assembly Using MAPREDUCE Framework (opens in a new tab)

Page 1 of 3