Search Results - "David, Matei"

  • Showing 1 - 14 results of 14
Refine Results
  1. 1

    Detecting DNA cytosine methylation using nanopore sequencing by Simpson, Jared T, Workman, Rachael E, Zuzarte, P C, David, Matei, Dursi, L J, Timp, Winston

    Published in Nature methods (01-04-2017)
    “…A hidden Markov model (HMM)-based tool enables detection of 5-methylcytosine (5-mC) from single-molecule nanopore-sequencing data generated directly from human…”
    Get full text
    Journal Article
  2. 2

    SHRiMP2: Sensitive yet Practical Short Read Mapping by DAVID, Matei, DZAMBA, Misko, LISTER, Dan, ILIE, Lucian, BRUDNO, Michael

    Published in Bioinformatics (01-04-2011)
    “…We report on a major update (version 2) of the original SHort Read Mapping Program (SHRiMP). SHRiMP2 primarily targets mapping sensitivity, and is able to…”
    Get full text
    Journal Article
  3. 3

    Nanocall: an open source basecaller for Oxford Nanopore sequencing data by David, Matei, Dursi, L J, Yao, Delia, Boutros, Paul C, Simpson, Jared T

    Published in Bioinformatics (Oxford, England) (01-01-2017)
    “…The highly portable Oxford Nanopore MinION sequencer has enabled new applications of genome sequencing directly in the field. However, the MinION currently…”
    Get full text
    Journal Article
  4. 4
  5. 5

    Deep-sequencing of endothelial cells exposed to hypoxia reveals the complexity of known and novel microRNAs by Voellenkle, Christine, Rooij, Jeroen van, Guffanti, Alessandro, Brini, Elena, Fasanaro, Pasquale, Isaia, Eleonora, Croft, Larry, David, Matei, Capogrossi, Maurizio C, Moles, Anna, Felsani, Armando, Martelli, Fabio

    Published in RNA (Cambridge) (01-03-2012)
    “…In order to understand the role of microRNAs (miRNAs) in vascular physiopathology, we took advantage of deep-sequencing techniques to accurately and…”
    Get full text
    Journal Article
  6. 6

    Detecting Alu insertions from high-throughput sequencing data by David, Matei, Mustafa, Harun, Brudno, Michael

    Published in Nucleic acids research (01-09-2013)
    “…High-throughput sequencing technologies have allowed for the cataloguing of variation in personal human genomes. In this manuscript, we present alu-detect, a…”
    Get full text
    Journal Article
  7. 7

    Tradeoff lower lounds for stack machines by David, Matei, Papakonstantinou, Periklis A.

    Published in Computational complexity (01-03-2014)
    “…A space-bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space-bounded read-write work tapes, and an unbounded stack…”
    Get full text
    Journal Article
  8. 8

    Assembly and characterization of novel Alu inserts detected from next-generation sequencing data by Mustafa, Harun, David, Matei, Brudno, Michael

    Published in Mobile genetic elements (01-10-2014)
    “…Repetitive elements generally, and Alu inserts specifically are a large contributor to the recent evolution of the human genome. By assembling the sequences of…”
    Get full text
    Journal Article
  9. 9

    How strong is Nisanʼs pseudo-random generator? by David, Matei, Papakonstantinou, Periklis A., Sidiropoulos, Anastasios

    Published in Information processing letters (30-08-2011)
    “…We study the resilience of the classical pseudo-random generator (PRG) of Nisan (1992) [6] against space-bounded machines that make multiple passes over the…”
    Get full text
    Journal Article
  10. 10

    Multiparty Communication Complexity by David, Matei

    Published 01-01-2010
    “…Communication complexity is an area of complexity theory that studies an abstract model of computation called a communication protocol. In a k-player…”
    Get full text
    Dissertation
  11. 11

    Trade-Off Lower Bounds for Stack Machines by David, Matei, Papakonstantinou, Periklis A

    “…A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack…”
    Get full text
    Conference Proceeding
  12. 12

    Multiparty Communication Complexity by David, Matei

    “…Communication complexity is an area of complexity theory that studies an abstract model of computation called a communication protocol. In a k-player…”
    Get full text
    Dissertation
  13. 13

    Wait-free linearizable queue implementations by David, Matei

    Published 01-01-2004
    “…We study wait-free linearizable Queue implementations in asynchronous shared-memory systems from other consensus number 2 types, such as Fetch&Add and Swap. It…”
    Get full text
    Dissertation
  14. 14

    Separating NOF communication complexity classes RP and NP by David, Matei, Pitassi, Toniann

    Published 26-02-2008
    “…We provide a non-explicit separation of the number-on-forehead communication complexity classes RP and NP when the number of players is up to \delta log(n) for…”
    Get full text
    Journal Article