Name
Abstract | ||
|---|---|---|
Motivation: Graph representations of genomes are capable of expressing more genetic variation and can therefore better represent a population than standard linear genomes. However, due to the greater complexity of genome graphs relative to linear genomes, some functions that are trivial on linear genomes become much more difficult in genome graphs. Calculating distance is one such function that is simple in a linear genome but complicated in a graph context. In read mapping algorithms such distance calculations are fundamental to determining if seed alignments could belong to the same mapping. Results: We have developed an algorithm for quickly calculating the minimum distance between positions on a sequence graph using a minimum distance index. We have also developed an algorithm that uses the distance index to cluster seeds on a graph. We demonstrate that our implementations of these algorithms are efficient and practical to use for a new generation of mapping algorithms based upon genome graphs. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1093/bioinformatics/btaa446 | BIOINFORMATICS |
Keywords | DocType | Volume |
Genome Graphs,Variation Graphs,Distance,Indexing,Clustering | Journal | 36 |
Issue | ISSN | Citations |
SUPnan | 1367-4803 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xian Chang | 1 | 0 | 0.34 |
| Jordan Eizenga | 2 | 0 | 0.34 |
| adam novak | 3 | 16 | 3.74 |
| Jouni Sirén | 4 | 222 | 14.85 |
| Benedict Paten | 5 | 266 | 24.52 |