Skip to main content
bioRxiv
  • Home
  • About
  • Submit
  • ALERTS / RSS
Advanced Search
New Results

Fast and memory-efficient noisy read overlapping with KD-trees

Dmitri Parkhomchuk, Andreas Bremges, Alice C. McHardy
doi: https://doi.org/10.1101/166835
Dmitri Parkhomchuk
1Helmholtz Centre for Infection Research, 38124 Braunschweig, Germany
2German Center for Infection Research (DZIF), 38124 Braunschweig, Germany
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
Andreas Bremges
1Helmholtz Centre for Infection Research, 38124 Braunschweig, Germany
2German Center for Infection Research (DZIF), 38124 Braunschweig, Germany
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
Alice C. McHardy
1Helmholtz Centre for Infection Research, 38124 Braunschweig, Germany
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
  • Abstract
  • Full Text
  • Info/History
  • Metrics
  • Preview PDF
Loading

Article Information

doi 
https://doi.org/10.1101/166835
History 
  • July 21, 2017.
Copyright 
The copyright holder for this preprint is the author/funder, who has granted bioRxiv a license to display the preprint in perpetuity. It is made available under a CC-BY 4.0 International license.

Author Information

  1. Dmitri Parkhomchuk1,2*†,
  2. Andreas Bremges1,2* and
  3. Alice C. McHardy1,†
  1. 1Helmholtz Centre for Infection Research, 38124 Braunschweig, Germany
  2. 2German Center for Infection Research (DZIF), 38124 Braunschweig, Germany
  1. ↵†To whom correspondence should be addressed.
  1. ↵* These authors contributed equally to this work.

  2. Contact: Alice.McHardy{at}helmholtz-hzi.de; pdmitri{at}hotmail.com

Back to top
PreviousNext
Posted July 21, 2017.
Download PDF
Email

Thank you for your interest in spreading the word about bioRxiv.

NOTE: Your email address is requested solely to identify you as the sender of this article.

Enter multiple addresses on separate lines or separate them with commas.
Fast and memory-efficient noisy read overlapping with KD-trees
(Your Name) has forwarded a page to you from bioRxiv
(Your Name) thought you would like to see this page from the bioRxiv website.
CAPTCHA
This question is for testing whether or not you are a human visitor and to prevent automated spam submissions.
Share
Fast and memory-efficient noisy read overlapping with KD-trees
Dmitri Parkhomchuk, Andreas Bremges, Alice C. McHardy
bioRxiv 166835; doi: https://doi.org/10.1101/166835
Reddit logo Twitter logo Facebook logo LinkedIn logo Mendeley logo
Citation Tools
Fast and memory-efficient noisy read overlapping with KD-trees
Dmitri Parkhomchuk, Andreas Bremges, Alice C. McHardy
bioRxiv 166835; doi: https://doi.org/10.1101/166835

Citation Manager Formats

  • BibTeX
  • Bookends
  • EasyBib
  • EndNote (tagged)
  • EndNote 8 (xml)
  • Medlars
  • Mendeley
  • Papers
  • RefWorks Tagged
  • Ref Manager
  • RIS
  • Zotero
  • Tweet Widget
  • Facebook Like
  • Google Plus One

Subject Area

  • Bioinformatics
Subject Areas
All Articles
  • Animal Behavior and Cognition (4229)
  • Biochemistry (9118)
  • Bioengineering (6753)
  • Bioinformatics (23948)
  • Biophysics (12103)
  • Cancer Biology (9498)
  • Cell Biology (13746)
  • Clinical Trials (138)
  • Developmental Biology (7618)
  • Ecology (11666)
  • Epidemiology (2066)
  • Evolutionary Biology (15479)
  • Genetics (10621)
  • Genomics (14298)
  • Immunology (9468)
  • Microbiology (22808)
  • Molecular Biology (9083)
  • Neuroscience (48896)
  • Paleontology (355)
  • Pathology (1479)
  • Pharmacology and Toxicology (2566)
  • Physiology (3826)
  • Plant Biology (8319)
  • Scientific Communication and Education (1467)
  • Synthetic Biology (2294)
  • Systems Biology (6172)
  • Zoology (1297)