Paul Medvedev
Paul Medvedev
Verified email at cse.psu.edu - Homepage
Title
Cited by
Cited by
Year
Computational methods for discovering structural variation with next-generation sequencing
P Medvedev, M Stanciu, M Brudno
Nature methods 6, S13-S20, 2009
5782009
Informed and automated k-mer size selection for genome assembly
R Chikhi, P Medvedev
Bioinformatics 30 (1), 31-37, 2014
4202014
Computability of models for sequence assembly
P Medvedev, K Georgiou, G Myers, M Brudno
International Workshop on Algorithms in Bioinformatics, 289-301, 2007
1762007
Detecting copy number variation with mated short reads
P Medvedev, M Fiume, M Dzamba, T Smith, M Brudno
Genome research 20 (11), 1613-1622, 2010
1732010
A self-coordinating approach to distributed fair queueing in ad hoc wireless networks
H Luo, P Medvedev, J Cheng, S Lu
INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and …, 2001
1402001
Error correction of high-throughput sequencing datasets with non-uniform coverage
P Medvedev, E Scott, B Kakaradov, P Pevzner
Bioinformatics 27 (13), i137-i141, 2011
1372011
Maximum likelihood genome assembly
P Medvedev, M Brudno
Journal of computational Biology 16 (8), 1101-1116, 2009
129*2009
Computational pan-genomics: status, promises and challenges
Computational Pan-Genomics Consortium
Briefings in Bioinformatics, bbw089, 2016
1152016
On the representation of de Bruijn graphs
R Chikhi, A Limasset, S Jackman, JT Simpson, P Medvedev
International Conference on Research in Computational Molecular Biology, 35-55, 2014
1002014
Complexity of independent set reconfigurability problems
M Kamiński, P Medvedev, M Milanič
Theoretical computer science 439, 9-15, 2012
982012
Paired de bruijn graphs: a novel approach for incorporating mate pair information into genome assemblers
P Medvedev, S Pham, M Chaisson, G Tesler, P Pevzner
Journal of Computational Biology 18 (11), 1625-1634, 2011
752011
Shortest paths between shortest paths
M Kamiński, P Medvedev, M Milanič
Theoretical computer science 412 (39), 5205-5210, 2011
69*2011
Compacting de Bruijn graphs from sequencing data quickly and in low memory
R Chikhi, A Limasset, P Medvedev
Bioinformatics 32 (12), i201-i208, 2016
662016
A time-and cost-effective strategy to sequence mammalian Y Chromosomes: an application to the de novo assembly of gorilla Y
M Tomaszkiewicz, S Rangavittal, M Cechova, RC Sanchez, ...
Genome research 26 (4), 530-540, 2016
592016
Accurate typing of short tandem repeats from genome-wide sequencing data and its applications
KD Fungtammasan, Arkarachai and Ananda, Guruprasad and Hile, Suzanne E and ...
Genome Research 25, 736--749, 2015
562015
Y and W chromosome assemblies: approaches and discoveries
M Tomaszkiewicz, P Medvedev, KD Makova
Trends in Genetics 33 (4), 266-282, 2017
412017
The relative worst order ratio applied to seat reservation
J Boyar, P Medvedev
ACM Transactions on Algorithms (TALG) 4 (4), 1-22, 2008
352008
TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph from many complete genomes
I Minkin, S Pham, P Medvedev
Bioinformatics 33 (24), 4024-4032, 2017
342017
AllSome Sequence Bloom Trees
C Sun, RS Harris, R Chikhi, P Medvedev
International Conference on Research in Computational Molecular Biology, 272-286, 2017
332017
Using state machines to model the Ion Torrent sequencing process and to improve read error rates
D Golan, P Medvedev
Bioinformatics 29 (13), i344-i351, 2013
322013
The system can't perform the operation now. Try again later.
Articles 1–20