Sequence graph (original) (raw)
Sequence graph, also called an alignment graph, breakpoint graph, or adjacency graph, are bidirected graphs used in comparative genomics. The structure consists of multiple graphs or genomes with a series of edges and vertices represented as adjacencies between segments in a genome and DNA segments respectively. Traversing a connected component of segments and adjacency edges (called a thread) yields a sequence, which typically represents a genome or a section of a genome. The segments can be thought of as synteny blocks, with the edges dictating how to arrange these blocks in a particular genome, and the labelling of the adjacency edges representing bases that are not contained in synteny blocks.
Property | Value |
---|---|
dbo:abstract | Sequence graph, also called an alignment graph, breakpoint graph, or adjacency graph, are bidirected graphs used in comparative genomics. The structure consists of multiple graphs or genomes with a series of edges and vertices represented as adjacencies between segments in a genome and DNA segments respectively. Traversing a connected component of segments and adjacency edges (called a thread) yields a sequence, which typically represents a genome or a section of a genome. The segments can be thought of as synteny blocks, with the edges dictating how to arrange these blocks in a particular genome, and the labelling of the adjacency edges representing bases that are not contained in synteny blocks. (en) |
dbo:wikiPageExternalLink | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2675983/ https://www.semanticscholar.org/paper/Breakpoint-graphs-and-ancestral-genome-Alekseyev-Pevzner/68b1125f392c2910e7866470e6f1d28d55f424ee/figure/0 |
dbo:wikiPageID | 49861393 (xsd:integer) |
dbo:wikiPageLength | 5482 (xsd:nonNegativeInteger) |
dbo:wikiPageRevisionID | 1095342311 (xsd:integer) |
dbo:wikiPageWikiLink | dbr:Deoxyribonucleic_Acid dbc:Bioinformatics dbc:Genomics dbc:Application-specific_graphs dbr:Genome dbr:Comparative_genomics dbr:Synteny dbr:Centimorgan dbc:Evolutionary_biology dbr:Homology_(biology) dbr:Reference_genome dbr:Human_genome dbr:Multiple_sequence_alignment |
dbp:wikiPageUsesTemplate | dbt:Reflist dbt:Short_description |
dcterms:subject | dbc:Bioinformatics dbc:Genomics dbc:Application-specific_graphs dbc:Evolutionary_biology |
rdfs:comment | Sequence graph, also called an alignment graph, breakpoint graph, or adjacency graph, are bidirected graphs used in comparative genomics. The structure consists of multiple graphs or genomes with a series of edges and vertices represented as adjacencies between segments in a genome and DNA segments respectively. Traversing a connected component of segments and adjacency edges (called a thread) yields a sequence, which typically represents a genome or a section of a genome. The segments can be thought of as synteny blocks, with the edges dictating how to arrange these blocks in a particular genome, and the labelling of the adjacency edges representing bases that are not contained in synteny blocks. (en) |
rdfs:label | Sequence graph (en) |
owl:sameAs | wikidata:Sequence graph dbpedia-fa:Sequence graph https://global.dbpedia.org/id/2Nvpr yago-res:Sequence graph |
prov:wasDerivedFrom | wikipedia-en:Sequence_graph?oldid=1095342311&ns=0 |
foaf:isPrimaryTopicOf | wikipedia-en:Sequence_graph |
is dbo:wikiPageWikiLink of | dbr:Transcriptomics_technologies |
is foaf:primaryTopic of | wikipedia-en:Sequence_graph |