Paul Medvedev

Orcid: 0000-0003-3143-594X

According to our database1, Paul Medvedev authored at least 53 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Theoretical Analysis of Edit Distance Algorithms.
Commun. ACM, December, 2023

Theoretical Analysis of Sequencing Bioinformatics Algorithms and Beyond.
Commun. ACM, July, 2023

Exact Sketch-Based Read Mapping.
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

Compression Algorithm for Colored de Bruijn Graphs.
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

2022
The Statistics of k-mers from a Sequence Undergoing a Simple Mutation Process Without Spurious Matches.
J. Comput. Biol., 2022

Data Structures to Represent a Set of <i>k</i>-long DNA Sequences.
ACM Comput. Surv., 2022

The limitations of the theoretical analysis of applied algorithms.
CoRR, 2022

Theoretical analysis of edit distance algorithms: an applied perspective.
CoRR, 2022

The K-mer File Format: a standardized and compact disk representation of sets of <i>k</i>-mers.
Bioinform., 2022

Uncovering Hidden Assembly Artifacts: When Unitigs are not Safe and Bidirected Graphs are not Helpful (ABSTRACT).
Proceedings of the Research in Computational Molecular Biology, 2022

2021
What do Eulerian and Hamiltonian cycles have to do with genome assembly?
PLoS Comput. Biol., 2021

Disk compression of k-mer sets.
Algorithms Mol. Biol., 2021

GYAN: Accelerating Bioinformatics Tools in Galaxy with GPU-Aware Computation Mapping.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021

2020
Bipartite graphs of small readability.
Theor. Comput. Sci., 2020

Ten Simple Rules for writing algorithmic bioinformatics conference papers.
PLoS Comput. Biol., 2020

De Novo Clustering of Long-Read Transcriptome Data Using a Greedy, Quality Value-Based Algorithm.
J. Comput. Biol., 2020

Improved representation of sequence bloom trees.
Bioinform., 2020

Representation of k-mer Sets Using Spectrum-Preserving String Sets.
Proceedings of the Research in Computational Molecular Biology, 2020

2019
An Optimal <i>O</i>(<i>nm</i>) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph.
ACM Trans. Algorithms, 2019

Data structures to represent sets of k-long DNA sequences.
CoRR, 2019

Toward fast and accurate SNP genotyping from whole genome sequencing data for bedside diagnostics.
Bioinform., 2019

Modeling biological problems in computer science: a case study in genome assembly.
Briefings Bioinform., 2019

2018
AllSome Sequence Bloom Trees.
J. Comput. Biol., 2018

RecoverY: k-mer-based read classification for Y-chromosome-specific sequencing and assembly.
Bioinform., 2018

Introduction to HiCOMB 2018.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

Parallel Read Partitioning for Concurrent Assembly of Metagenomic Data.
Proceedings of the 25th IEEE International Conference on High Performance Computing, 2018

2017
Safe and Complete Contig Assembly Through Omnitigs.
J. Comput. Biol., 2017

VarMatch: robust matching of small variant datasets using flexible scoring schemes.
Bioinform., 2017

TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes.
Bioinform., 2017

Parallel and Memory-Efficient Preprocessing for Metagenome Assembly.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

Optimal Omnitig Listing for Safe and Complete Contig Assembly.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
On the readability of overlap digraphs.
Discret. Appl. Math., 2016

Compacting de Bruijn graphs from sequencing data quickly and in low memory.
Bioinform., 2016

Safe and Complete Contig Assembly Via Omnitigs.
Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

The Second Decade of the International Conference on Research in Computational Molecular Biology (RECOMB).
Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

2015
On the Representation of De Bruijn Graphs.
J. Comput. Biol., 2015

2014
Informed and automated <i>k</i>-mer size selection for genome assembly.
Bioinform., 2014

2013
Using state machines to model the Ion Torrent sequencing process and to improve read error rates.
Bioinform., 2013

2012
Complexity of independent set reconfigurability problems.
Theor. Comput. Sci., 2012

2011
Genome Graphs.
PhD thesis, 2011

Shortest paths between shortest paths.
Theor. Comput. Sci., 2011

Paired de Bruijn Graphs: A Novel Approach for Incorporating Mate Pair Information into Genome Assemblers.
J. Comput. Biol., 2011

Error correction of high-throughput sequencing datasets with non-uniform coverage.
Bioinform., 2011

2010
Rearrangement Models and Single-Cut Operations.
J. Comput. Biol., 2010

Shortest Paths between Shortest Paths and Independent Sets.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
Maximum Likelihood Genome Assembly.
J. Comput. Biol., 2009

On the Plane-Width of Graphs.
Electron. Notes Discret. Math., 2009

A report on the 2009 SIG on short read sequencing and algorithms (Short-SIG).
Bioinform., 2009

Rearrangement Models and Single-Cut Operations.
Proceedings of the Comparative Genomics, International Workshop, 2009

2008
The relative worst order ratio applied to seat reservation.
ACM Trans. Algorithms, 2008

Ab Initio Whole Genome Shotgun Assembly with Mated Short Reads.
Proceedings of the Research in Computational Molecular Biology, 2008

2007
Computability of Models for Sequence Assembly.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

2001
A Self-Coordinating Approach to Distributed Fair Queueing in Ad Hoc Wireless Networks.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001


  Loading...