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

Efficient minimizer orders for large values of k using minimum decycling sets

David Pellow, Lianrong Pu, Baris Ekim, Lior Kotlar, Bonnie Berger, Ron Shamir, View ORCID ProfileYaron Orenstein
doi: https://doi.org/10.1101/2022.10.18.512682
David Pellow
1Blavatnik School of Computer Science, Tel-Aviv University, Israel
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
Lianrong Pu
1Blavatnik School of Computer Science, Tel-Aviv University, Israel
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
Baris Ekim
2Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
Lior Kotlar
3Department of Computer Science, Ben-Gurion University, Israel
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
Bonnie Berger
2Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
Ron Shamir
1Blavatnik School of Computer Science, Tel-Aviv University, Israel
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
Yaron Orenstein
4Department of Computer Science, Bar-Ilan University, Israel
5The Mina and Everard Goodman Faculty of Life Sciences, Bar-Ilan University, Israel
  • Find this author on Google Scholar
  • Find this author on PubMed
  • Search for this author on this site
  • ORCID record for Yaron Orenstein
  • For correspondence: yaron.orenstein@gmail.com
  • Abstract
  • Full Text
  • Info/History
  • Metrics
  • Supplementary material
  • Data/Code
  • Preview PDF
Loading

Article Information

doi 
https://doi.org/10.1101/2022.10.18.512682
History 
  • October 21, 2022.

Article Versions

  • You are currently viewing Version 1 of this article (October 21, 2022 - 13:44).
  • View Version 2, the most recent version of this article.
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-NC 4.0 International license.

Author Information

  1. David Pellow1,
  2. Lianrong Pu1,
  3. Baris Ekim2,
  4. Lior Kotlar3,
  5. Bonnie Berger2,
  6. Ron Shamir1 and
  7. Yaron Orenstein4,5,*
  1. 1Blavatnik School of Computer Science, Tel-Aviv University, Israel
  2. 2Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA
  3. 3Department of Computer Science, Ben-Gurion University, Israel
  4. 4Department of Computer Science, Bar-Ilan University, Israel
  5. 5The Mina and Everard Goodman Faculty of Life Sciences, Bar-Ilan University, Israel
  1. ↵*Corresponding author; email: yaron.orenstein{at}gmail.com
Back to top
PreviousNext
Posted October 21, 2022.
Download PDF

Supplementary Material

Data/Code
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.
Efficient minimizer orders for large values of k using minimum decycling sets
(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
Efficient minimizer orders for large values of k using minimum decycling sets
David Pellow, Lianrong Pu, Baris Ekim, Lior Kotlar, Bonnie Berger, Ron Shamir, Yaron Orenstein
bioRxiv 2022.10.18.512682; doi: https://doi.org/10.1101/2022.10.18.512682
Digg logo Reddit logo Twitter logo Facebook logo Google logo LinkedIn logo Mendeley logo
Citation Tools
Efficient minimizer orders for large values of k using minimum decycling sets
David Pellow, Lianrong Pu, Baris Ekim, Lior Kotlar, Bonnie Berger, Ron Shamir, Yaron Orenstein
bioRxiv 2022.10.18.512682; doi: https://doi.org/10.1101/2022.10.18.512682

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 (4095)
  • Biochemistry (8792)
  • Bioengineering (6495)
  • Bioinformatics (23405)
  • Biophysics (11769)
  • Cancer Biology (9173)
  • Cell Biology (13304)
  • Clinical Trials (138)
  • Developmental Biology (7426)
  • Ecology (11392)
  • Epidemiology (2066)
  • Evolutionary Biology (15127)
  • Genetics (10419)
  • Genomics (14029)
  • Immunology (9154)
  • Microbiology (22132)
  • Molecular Biology (8797)
  • Neuroscience (47470)
  • Paleontology (350)
  • Pathology (1423)
  • Pharmacology and Toxicology (2486)
  • Physiology (3712)
  • Plant Biology (8073)
  • Scientific Communication and Education (1434)
  • Synthetic Biology (2217)
  • Systems Biology (6023)
  • Zoology (1251)