Följ
Paul Medvedev
Paul Medvedev
Verifierad e-postadress på cse.psu.edu - Startsida
Titel
Citeras av
Citeras av
År
Computational methods for discovering structural variation with next-generation sequencing
P Medvedev, M Stanciu, M Brudno
Nature methods 6, S13-S20, 2009
6502009
Informed and automated k-mer size selection for genome assembly
R Chikhi, P Medvedev
Bioinformatics 30 (1), 31-37, 2014
6202014
Towards complete and error-free genome assemblies of all vertebrate species
A Rhie, SA McCarthy, O Fedrigo, J Damas, G Formenti, S Koren, ...
Nature 592 (7856), 737-746, 2021
3182021
Computational pan-genomics: status, promises and challenges
Computational Pan-Genomics Consortium
Briefings in Bioinformatics, bbw089, 2016
2422016
Computability of models for sequence assembly
P Medvedev, K Georgiou, G Myers, M Brudno
International Workshop on Algorithms in Bioinformatics, 289-301, 2007
2062007
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
1982010
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
1602011
Compacting de Bruijn graphs from sequencing data quickly and in low memory
R Chikhi, A Limasset, P Medvedev
Bioinformatics 32 (12), i201-i208, 2016
1582016
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
1512001
On the representation of de Bruijn graphs
R Chikhi, A Limasset, S Jackman, JT Simpson, P Medvedev
Journal of Computational Biology 22 (5), 336-352, 2015
1502015
Maximum likelihood genome assembly
P Medvedev, M Brudno
Journal of computational Biology 16 (8), 1101-1116, 2009
143*2009
Complexity of independent set reconfigurability problems
M Kamiński, P Medvedev, M Milanič
Theoretical computer science 439, 9-15, 2012
1312012
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
1012011
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
882015
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
862016
Y and W chromosome assemblies: approaches and discoveries
M Tomaszkiewicz, P Medvedev, KD Makova
Trends in genetics 33 (4), 266-282, 2017
842017
Shortest paths between shortest paths
M Kamiński, P Medvedev, M Milanič
Theoretical computer science 412 (39), 5205-5210, 2011
80*2011
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
722017
Error correction enables use of Oxford Nanopore technology for reference-free transcriptome analysis
K Sahlin, P Medvedev
Nature communications 12 (1), 1-13, 2021
552021
Giraffe genome sequence reveals clues to its unique morphology and physiology
M Agaba, E Ishengoma, WC Miller, BC McGrath, CN Hudson, OCB Reina, ...
Nature Communications 7, 2016
522016
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20