Páll Melsted

22 papers A* 1Journal 18Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Long-read sequencing transcriptome quantification with lr-kallisto.
PLoS Comput. Biol.
Rebekah K. Loving, Delaney K. Sullivan, Fairlie Reese, Elisabeth Rebboah, Jasmine Sakr, Narges Rezaie, Heidi Y. Liang, Ghassan Filimban, Shimako Kawauchi, A. Sina Booeshaghi, Páll Melsted, Conrad Oakes, Diane Trout, Brian A. Williams, Grant R. Macgregor, Barbara J. Wold, Ali Mortazavi, Lior Pachter
2023 J jnl
BUSZ: compressed BUS files.
Bioinform.
Pétur Helgi Einarsson, Páll Melsted
2020 J jnl
Algorithm 1005: Fortran Subroutines for Reverse Mode Algorithmic Differentiation of BLAS Matrix Operations.
ACM Trans. Math. Softw.
Kristjan Jonasson, Sven Sigurdsson, Hordur Freyr Yngvason, Petur Orri Ragnarsson, Páll Melsted
2019 J jnl
The barcode, UMI, set format and BUStools.
Bioinform.
Páll Melsted, Vasilis Ntranos, Lior Pachter
2017 J jnl
Pseudoalignment for metagenomic read assignment.
Bioinform.
Lorian Schaeffer, Harold Pimentel, Nicolas Bray, Páll Melsted, Lior Pachter
2016 J jnl
BamHash: a checksum program for verifying the integrity of sequence data.
Bioinform.
Arna Óskarsdóttir, Gísli Másson, Páll Melsted
2016 J jnl
PopIns: population-scale detection of novel sequence insertions.
Bioinform.
Birte Kehr, Páll Melsted, Bjarni V. Halldórsson
2016 J jnl
The Lair: a resource for exploratory analysis of published RNA-Seq data.
BMC Bioinform.
Harold Pimentel, Pascal Sturmfels, Nicolas Bray, Páll Melsted, Lior Pachter
2016 J jnl
chopBAI: BAM index reduction solves I/O bottlenecks in the joint analysis of large sequencing cohorts.
Bioinform.
Birte Kehr, Páll Melsted
2015 J jnl
Near-optimal RNA-Seq quantification.
CoRR
Nicolas Bray, Harold Pimentel, Páll Melsted, Lior Pachter
2014 J jnl
KmerStream: streaming algorithms for
Bioinform.
Páll Melsted, Bjarni V. Halldórsson
2012 J jnl
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables.
Random Struct. Algorithms
Alan M. Frieze, Páll Melsted
2011 J jnl
An Analysis of Random-Walk Cuckoo Hashing.
SIAM J. Comput.
Alan M. Frieze, Páll Melsted, Michael Mitzenmacher
2011 J jnl
Efficient counting of k-mers in DNA sequences using a Bloom Filter.
BMC Bioinform.
Páll Melsted, Jonathan K. Pritchard
2011 J jnl
Randomly coloring simple hypergraphs.
Inf. Process. Lett.
Alan M. Frieze, Páll Melsted
2010 J jnl
Finding a maximum matching in a sparse random graph in
J. ACM
Prasad Chebolu, Alan M. Frieze, Páll Melsted
2009 — conf
An Analysis of Random-Walk Cuckoo Hashing.
APPROX-RANDOM
Alan M. Frieze, Páll Melsted, Michael Mitzenmacher
2009 — conf
Average-Case Analyses of Vickrey Costs.
APPROX-RANDOM
Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin
2009 J jnl
Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables
CoRR
Alan M. Frieze, Páll Melsted
2009 J jnl
Randomly colouring simple hypergraphs
CoRR
Alan M. Frieze, Páll Melsted
2008 — conf
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time.
ICALP (1)
Prasad Chebolu, Alan M. Frieze, Páll Melsted
2008 A* conf
PageRank and the random surfer model.
SODA
Prasad Chebolu, Páll Melsted