Son K. Pham

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Dmitry Antipov

> Home > Persons > Son K. Pham

Publications

2013
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/jcb/PhamASTPA13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcb/PhamASTPA13
Son K. Pham, Dmitry Antipov, Alexander Sirotkin, Glenn Tesler, Pavel A. Pevzner, Max A. Alekseyev:
Pathset Graphs: A Novel Approach for Comprehensive Utilization of Paired Reads in Genome Assembly. J. Comput. Biol. 20(4): 359-371 (2013)
2012
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/jcb/BankevichNAGDKLNPPPSVTAP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcb/BankevichNAGDKLNPPPSVTAP12
Anton Bankevich, Sergey Nurk, Dmitry Antipov, Alexey A. Gurevich, Mikhail Dvorkin, Alexander S. Kulikov, Valery M. Lesin, Sergey I. Nikolenko, Son K. Pham, Andrey D. Prjibelski, Alex Pyshkin, Alexander Sirotkin, Nikolay Vyahhi, Glenn Tesler, Max A. Alekseyev, Pavel A. Pevzner:
SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing. J. Comput. Biol. 19(5): 455-477 (2012)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/recomb/PhamASTPA12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/recomb/PhamASTPA12
Son K. Pham, Dmitry Antipov, Alexander Sirotkin, Glenn Tesler, Pavel A. Pevzner, Max A. Alekseyev:
Pathset Graphs: A Novel Approach for Comprehensive Utilization of Paired Reads in Genome Assembly. RECOMB 2012: 200-212

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.