Benedict Paten

Summary

Affiliation: University of California
Country: USA

Publications

  1. pmc Genome-wide nucleotide-level mammalian ancestor reconstruction
    Benedict Paten
    Center for Biomolecular Science and Engineering, University of California Santa Cruz, Santa Cruz, California 95064, USA
    Genome Res 18:1829-43. 2008
  2. doi request reprint Cactus graphs for genome comparisons
    Benedict Paten
    Center for Biomolecular Science and Engineering, University of California, Santa Cruz, California, USA
    J Comput Biol 18:469-81. 2011
  3. pmc Enredo and Pecan: genome-wide mammalian consistency-based multiple alignment with paralogs
    Benedict Paten
    Center for Biomolecular Science and Engineering, University of California, Santa Cruz, California 95064, USA
    Genome Res 18:1814-28. 2008
  4. doi request reprint Sequence progressive alignment, a framework for practical large-scale probabilistic consistency alignment
    Benedict Paten
    Department of Engineering, University of California, Santa Cruz CA, USA
    Bioinformatics 25:295-301. 2009
  5. pmc Cactus: Algorithms for genome multiple sequence alignment
    Benedict Paten
    Center for Biomolecular Science and Engineering, University of California Santa Cruz, CA 95064, USA
    Genome Res 21:1512-28. 2011
  6. pmc HAL: a hierarchical format for storing and analyzing multiple genome alignments
    Glenn Hickey
    Center for Biomolecular Science and Engineering, University of California Santa Cruz, Santa Cruz CA 95064, USA
    Bioinformatics 29:1341-2. 2013
  7. pmc Accurate reconstruction of insertion-deletion histories by statistical phylogenetics
    Oscar Westesson
    University of California Berkeley and University of California San Francisco Graduate Program in Bioengineering, University of California, Berkeley, California, United States of America
    PLoS ONE 7:e34572. 2012
  8. pmc Assemblathon 1: a competitive assessment of de novo short read assembly methods
    Dent Earl
    Center for Biomolecular Science and Engineering, University of California, Santa Cruz, California 95064, USA
    Genome Res 21:2224-41. 2011
  9. pmc Meta-alignment with crumble and prune: partitioning very large alignment problems for performance and parallelization
    Krishna M Roskin
    Department of Computer Science, Univ of California, Santa Cruz, USA
    BMC Bioinformatics 12:144. 2011

Collaborators

Detail Information

Publications9

  1. pmc Genome-wide nucleotide-level mammalian ancestor reconstruction
    Benedict Paten
    Center for Biomolecular Science and Engineering, University of California Santa Cruz, Santa Cruz, California 95064, USA
    Genome Res 18:1829-43. 2008
    ..As a first piece of analysis, we attempt to recover "fossilized" ancestral pseudogenes. We confidently find 31 cases in which the ancestral sequence had a more complete sequence than any of the extant sequences...
  2. doi request reprint Cactus graphs for genome comparisons
    Benedict Paten
    Center for Biomolecular Science and Engineering, University of California, Santa Cruz, California, USA
    J Comput Biol 18:469-81. 2011
    ..Supplementary Material is available at www.liebertonline.com/cmb ...
  3. pmc Enredo and Pecan: genome-wide mammalian consistency-based multiple alignment with paralogs
    Benedict Paten
    Center for Biomolecular Science and Engineering, University of California, Santa Cruz, California 95064, USA
    Genome Res 18:1814-28. 2008
    ..Alignments from our pipeline are publicly available within the Ensembl genome browser...
  4. doi request reprint Sequence progressive alignment, a framework for practical large-scale probabilistic consistency alignment
    Benedict Paten
    Department of Engineering, University of California, Santa Cruz CA, USA
    Bioinformatics 25:295-301. 2009
    ..However, less work has been done in making promising methods that work on the small-scale practically for the alignment of much larger genomic sequences...
  5. pmc Cactus: Algorithms for genome multiple sequence alignment
    Benedict Paten
    Center for Biomolecular Science and Engineering, University of California Santa Cruz, CA 95064, USA
    Genome Res 21:1512-28. 2011
    ..Finally, we make an empirical assessment of Cactus's ability to properly align genes and find interesting cases of intra-gene duplication within the primates...
  6. pmc HAL: a hierarchical format for storing and analyzing multiple genome alignments
    Glenn Hickey
    Center for Biomolecular Science and Engineering, University of California Santa Cruz, Santa Cruz CA 95064, USA
    Bioinformatics 29:1341-2. 2013
    ..This loss of information grows with the number of species under comparison, as well as their phylogenetic distance...
  7. pmc Accurate reconstruction of insertion-deletion histories by statistical phylogenetics
    Oscar Westesson
    University of California Berkeley and University of California San Francisco Graduate Program in Bioengineering, University of California, Berkeley, California, United States of America
    PLoS ONE 7:e34572. 2012
    ..The algorithm can also be used for alignment-free inference, where the MSA is explicitly summed out of the analysis. As an illustration of our method, we discuss reconstruction of the evolutionary histories of human protein-coding genes...
  8. pmc Assemblathon 1: a competitive assessment of de novo short read assembly methods
    Dent Earl
    Center for Biomolecular Science and Engineering, University of California, Santa Cruz, California 95064, USA
    Genome Res 21:2224-41. 2011
    ..The simulated benchmark, including the correct answer, the assemblies, and the code that was used to evaluate the assemblies is now public and freely available from http://www.assemblathon.org/...
  9. pmc Meta-alignment with crumble and prune: partitioning very large alignment problems for performance and parallelization
    Krishna M Roskin
    Department of Computer Science, Univ of California, Santa Cruz, USA
    BMC Bioinformatics 12:144. 2011
    ..Both methods partition the problem such that many of the sub-problems can be solved independently. The results are then combined to form a solution to the full alignment problem...