Results 181 to 190 of about 964 (217)
Some of the next articles are maybe not open access.

Graph-based pan-genomes: increased opportunities in plant genomics

Journal of Experimental Botany, 2022
Abstract Due to the development of sequencing technology and the great reduction in sequencing costs, an increasing number of plant genomes have been assembled, and numerous genomes have revealed large amounts of variations. However, a single reference genome does not allow the exploration of species diversity, and therefore the ...
Shuo Wang   +4 more
openaire   +2 more sources

Graph Modeling for Genomics and Epidemiology

2023
The last decades have seen great leaps made in the development of RNA sequencing technologies, yielding lower cost and greater throughput of experiments, to the point where the scale of the data produced on a daily basis is staggering. While computational hardware is also continuously improving, famously (or perhaps infamously) described by Gordon ...
openaire   +2 more sources

A GRAPH DATABASE WITH VISUAL QUERIES FOR GENOMICS

Proceedings of the 3rd Asia-Pacific Bioinformatics Conference, 2005
Effective management of data is a major issue in genomics. Genomics data consists of highly interrelated information about genes, proteins, patterns, classifications, and interactions. Graph databases, which model graphs or networks of data, seem a natural way to manage genomics data.
Greg Butler   +3 more
openaire   +2 more sources

Scalable Assembly for Massive Genomic Graphs

2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), 2017
Scientists increasingly want to assemble large genomes, metagenomes, and large numbers of individual genomes. In order to meet the demand for processing these huge datasets, parallel genome assembly is a vital step. Among all the parallel genome assemblers, de Bruijn graph based ones are most popular.
Jintao Meng 0001   +5 more
openaire   +1 more source

Graph Data Modelling for Genomic Variants

2019 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI), 2019
Genome variant analysis is performed on Variant Call Format (VCF) files. It can take days to process these files for genome analytics due to challenges such as loading the files for each user query and processing them to answer questions of interest. As data sizes grow, timely processing of this data is putting enormous pressure on the computational ...
Anjum, Ashiq, Aizad, Sanna
openaire   +2 more sources

The ‘Butterfly effect’ in Cayley graphs with applications to genomics

Journal of Mathematical Biology, 2011
Suppose a finite set X is repeatedly transformed by a sequence of permutations of a certain type acting on an initial element x to produce a final state y. For example, in genomics applications, X could be a set of genomes and the permutations certain genome 'rearrangements' or, in group theory, X could be the set of configurations of a Rubik's cube ...
Moulton, Vincent, Steel, Mike
openaire   +3 more sources

Goodbye reference, hello genome graphs

Nature Biotechnology, 2019
Algorithms for building a variant-aware human graph genome enable fast and accurate genotyping without huge memory requirements.
openaire   +3 more sources

From de Bruijn Graphs to Rectangle Graphs for Genome Assembly

2012
Jigsaw puzzles were originally constructed by painting a picture on a rectangular piece of wood and further cutting it into smaller pieces with a jigsaw. The Jigsaw Puzzle Problem is to find an arrangement of these pieces that fills up the rectangle in such a way that neighboring pieces have "matching" boundaries with respect to color and texture ...
Nikolay Vyahhi   +3 more
openaire   +2 more sources

Using Random Graphs in Population Genomics

2013
I shall discuss the application of algorithmic and combinatorial tools in the area of population genomics, which has not been the traditional stomping ground for algorithmicists.
openaire   +1 more source

Exploring Frequented Regions in Pan-Genomic Graphs

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2017
We consider the problem of identifying regions within a pan-genome De Bruijn graph that are traversed by many sequence paths. We define such regions and the subpaths that traverse them as frequented regions (FRs). In this work, we formalize the FR problem and describe an efficient algorithm for finding FRs. Subsequently, we propose some applications of
Alan M. Cleary   +4 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy