Páll Melsted

According to our database, Páll Melsted authored at least 20 papers between 2008 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

BUSZ: compressed BUS files.

Pétur Helgi Einarsson, Páll Melsted

Bioinform., May, 2023

2020

Algorithm 1005: Fortran Subroutines for Reverse Mode Algorithmic Differentiation of BLAS Matrix Operations.

Kristjan Jonasson, Sven Sigurdsson, Hordur Freyr Yngvason, Petur Orri Ragnarsson, Páll Melsted

ACM Trans. Math. Softw., 2020

2019

The barcode, UMI, set format and BUStools.

Páll Melsted, Vasilis Ntranos, Lior Pachter

Bioinform., 2019

2017

Pseudoalignment for metagenomic read assignment.

Lorian Schaeffer, Harold Pimentel, Nicolas Bray, Páll Melsted, Lior Pachter

Bioinform., 2017

2016

The Lair: a resource for exploratory analysis of published RNA-Seq data.

Harold Pimentel, Pascal Sturmfels, Nicolas Bray, Páll Melsted, Lior Pachter

BMC Bioinform., 2016

BamHash: a checksum program for verifying the integrity of sequence data.

Arna Óskarsdóttir, Gísli Másson, Páll Melsted

Bioinform., 2016

PopIns: population-scale detection of novel sequence insertions.

Birte Kehr, Páll Melsted, Bjarni V. Halldórsson

Bioinform., 2016

chopBAI: BAM index reduction solves I/O bottlenecks in the joint analysis of large sequencing cohorts.

Birte Kehr, Páll Melsted

Bioinform., 2016

2015

Near-optimal RNA-Seq quantification.

Nicolas Bray, Harold Pimentel, Páll Melsted, Lior Pachter

CoRR, 2015

2014

KmerStream: streaming algorithms for <i>k</i>-mer abundance estimation.

Páll Melsted, Bjarni V. Halldórsson

Bioinform., 2014

2012

Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables.

Alan M. Frieze, Páll Melsted

Random Struct. Algorithms, 2012

2011

An Analysis of Random-Walk Cuckoo Hashing.

Alan M. Frieze, Páll Melsted, Michael Mitzenmacher

SIAM J. Comput., 2011

Randomly coloring simple hypergraphs.

Alan M. Frieze, Páll Melsted

Inf. Process. Lett., 2011

Efficient counting of k-mers in DNA sequences using a Bloom Filter.

Páll Melsted, Jonathan K. Pritchard

BMC Bioinform., 2011

2010

Finding a maximum matching in a sparse random graph in <i>O</i>(<i>n</i>) expected time.

Prasad Chebolu, Alan M. Frieze, Páll Melsted

J. ACM, 2010

2009

Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables

Alan M. Frieze, Páll Melsted

CoRR, 2009

Randomly colouring simple hypergraphs

Alan M. Frieze, Páll Melsted

CoRR, 2009

Average-Case Analyses of Vickrey Costs.

Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin

Proceedings of the Approximation, 2009

2008

PageRank and the random surfer model.

Prasad Chebolu, Páll Melsted

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time.

Prasad Chebolu, Alan M. Frieze, Páll Melsted

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008