Year |
Citation |
Score |
2020 |
Holley G, Melsted P. Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs. Genome Biology. 21: 249. PMID 32943081 DOI: 10.1186/S13059-020-02135-8 |
0.445 |
|
2019 |
Eggertsson HP, Kristmundsdottir S, Beyter D, Jonsson H, Skuladottir A, Hardarson MT, Gudbjartsson DF, Stefansson K, Halldorsson BV, Melsted P. GraphTyper2 enables population-scale genotyping of structural variation using pangenome graphs. Nature Communications. 10: 5402. PMID 31776332 DOI: 10.1038/S41467-019-13341-9 |
0.336 |
|
2017 |
Eggertsson HP, Jonsson H, Kristmundsdottir S, Hjartarson E, Kehr B, Masson G, Zink F, Hjorleifsson KE, Jonasdottir A, Jonasdottir A, Jonsdottir I, Gudbjartsson DF, Melsted P, Stefansson K, Halldorsson BV. Graphtyper enables population-scale genotyping using pangenome graphs. Nature Genetics. PMID 28945251 DOI: 10.1038/Ng.3964 |
0.344 |
|
2016 |
Kehr B, Melsted P. chopBAI: BAM index reduction solves I/O bottlenecks in the joint analysis of large sequencing cohorts. Bioinformatics (Oxford, England). PMID 27153590 DOI: 10.1093/Bioinformatics/Btw149 |
0.3 |
|
2012 |
Frieze A, Melsted P. Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables Random Structures and Algorithms. 41: 334-364. DOI: 10.1002/Rsa.20427 |
0.621 |
|
2011 |
Frieze A, Melsted P, Mitzenmacher M. An Analysis of Random-Walk Cuckoo Hashing Siam Journal On Computing. 40: 291-308. DOI: 10.1137/090770928 |
0.613 |
|
2011 |
Frieze A, Melsted P. Randomly coloring simple hypergraphs Information Processing Letters. 111: 848-853. DOI: 10.1016/J.Ipl.2011.06.001 |
0.327 |
|
2010 |
Chebolu P, Frieze A, Melsted P. Finding a maximum matching in a sparse random graph in O ( n ) expected time Journal of the Acm. 57: 24. DOI: 10.1145/1734213.1734218 |
0.674 |
|
2009 |
Chebolu P, Frieze A, Melsted P, Sorkin GB. Average-case analyses of Vickrey costs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5687: 434-447. DOI: 10.1007/978-3-642-03685-9_33 |
0.653 |
|
2008 |
Chebolu P, Frieze A, Melsted P. Finding a maximum matching in a sparse random graph in O(n) expected time Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5125: 161-172. DOI: 10.1007/978-3-540-70575-8_14 |
0.722 |
|
2008 |
Chebolu P, Melsted P. PageRank and the Random Surfer Model Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1010-1018. |
0.687 |
|
Show low-probability matches. |