F1000Research F1000Research 2046-1402 F1000 Research Limited London, UK 10.12688/f1000research.6924.1 Software Tool Article Articles Bioinformatics The khmer software package: enabling efficient nucleotide sequence analysis

[version 1; peer review: 2 approved, 1 approved with reservations]

 Crusoe Michael R. https://orcid.org/0000-0002-2961-9670 1 Alameldin Hussien F. 2 Awad Sherine 3 Boucher Elmar 4 Caldwell Adam 5 Cartwright Reed 6 Charbonneau Amanda 7 Constantinides Bede 8 Edvenson Greg 9 Fay Scott 10 Fenton Jacob 11 Fenzl Thomas 12 Fish Jordan 11 Garcia-Gutierrez Leonor 13 Garland Phillip 14 Gluck Jonathan 15 González Iván 16 Guermond Sarah 17 Guo Jiarong 18 Gupta Aditi 1 Herr Joshua R. 1 Howe Adina https://orcid.org/0000-0002-7705-343X 19 Hyer Alex 20 Härpfer Andreas 21 Irber Luiz 11 Kidd Rhys 22 Lin David 23 Lippi Justin 24 Mansour Tamer 3 25 McA'Nulty Pamela 26 McDonald Eric 11 Mizzi Jessica 27 Murray Kevin D. 28 Nahum Joshua R. 29 Nanlohy Kaben 30 Nederbragt Alexander Johan https://orcid.org/0000-0001-5539-0999 31 Ortiz-Zuazaga Humberto 32 Ory Jeramia 33 Pell Jason 11 Pepe-Ranney Charles 34 Russ Zachary N. 35 Schwarz Erich 36 Scott Camille 11 Seaman Josiah 37 Sievert Scott 38 Simpson Jared 39 40 Skennerton Connor T. 41 Spencer James 42 Srinivasan Ramakrishnan 43 Standage Daniel 44 45 Stapleton James A. 46 Steinman Susan R. 47 Stein Joe 48 Taylor Benjamin 11 Trimble Will 49 Wiencko Heather L. 50 Wright Michael 11 Wyss Brian 11 Zhang Qingpeng 11 zyme en 51 Brown C. Titus a 1 3 11 Microbiology and Molecular Genetics, Michigan State University, East Lansing, MI, USA Department of Plant, Soil and Microbial Sciences, Michigan State University, East Lansing, MI, USA Population Health and Reproduction, University of California, Davis, Davis, CA, USA Department of Biomedical Engineering, Oregon Health and Science University, Portland, OR, USA Biology Department, San Jose State University, San Jose, CA, USA School of Life Sciences and The Biodesign Institute, Arizona State University, Tempe, AZ, USA Genetics, Michigan State University, East Lansing, MI, USA Computational and Evolutionary Biology, Faculty of Life Sciences, University of Manchester, Manchester, UK Micron Technology, Seattle, WA, USA Invitae, San Francisco, CA, USA Computer Science and Engineering, Michigan State University, East Lansing, MI, USA Independent Researcher, Munich, Germany Mathematics Institute, University of Warwick, Warwick, UK Eastlake Data, Seattle, WA, USA Graduate Program, University of Maryland, College Park, MD, USA Athinoula A. Martinos Center for Biomedical Imaging, Department of Radiology, Massachusetts General Hospital, Charlestown, MA, USA Independent Researcher, Seattle, WA, USA Center for Microbial Ecology, Michigan State University, East Lansing, MI, USA Department of Agricultural and Biosystems Engineering, Iowa State University, Ames, IA, USA Department of Biology, University of Utah, Salt Lake City, UT, USA ConSol* Software GmbH, Munchen, Germany Independent Researcher, Sydney, Australia Verdematics, Fremont, CA, USA Independent Researcher, San Francisco, CA, USA Clinical Pathology, Mansoura University, Mansoura, Egypt Addgene, Cambridge, MA, USA Biochemistry and Molecular Biology, Michigan State University, East Lansing, MI, USA ARC Centre of Excellence in Plant Energy Biology, The Australian National University, Canberra, ACT, Australia BEACON Center, Michigan State University, East Lansing, MI, USA Independent Researcher, New Orleans, LA, USA Centre for Ecological and Evolutionary Synthesis, Dept. of Biosciences, University of Oslo, Oslo, Norway Department of Computer Science, Rio Piedras Campus, University of Puerto Rico, San Juan, Puerto Rico Biochemistry, St. Louis College of Pharmacy, St. Louis, MO, USA Crop and Soil Sciences, Cornell University, Ithaca, NY, USA Department of Bioengineering, UC Berkeley, Berkeley, CA, USA Department of Molecular Biology and Genetics, Cornell University, Ithaca, NY, USA Data Visualization, Newline Technical Innovations, Windsor, CO, USA Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA Ontario Institute for Cancer Research, Toronto, ON, Canada Computer Science, University of Toronto, Toronto, ON, Canada Division of Geological and Planetary Sciences, California Institute of Technology, Pasadena, CA, USA Dept of Physics and Dept of Materials, Imperial College London, London, UK Genetics and Genomic Sciences, Icahn School of Medicine at Mount Sinai, New York, NY, USA Department of Biology, Indiana University, Bloomington, IN, USA Bioinformatics and Computational Biology Graduate Program, Iowa State University, Ames, IA, USA Chemical Engineering & Materials Science, Michigan State University, East Lansing, MIS, USA The New York Eye and Ear Infirmary of Mount Sinai, New York, NY, USA Independent Researcher, Providence, RI, USA Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, IL, USA Department of Genetics, Smurfit Institute, Trinity College Dublin, Dublin, Ireland Independent Researcher, Boston, MA, USA titus@idyll.org

CTB is the primary investigator for the khmer software package. MRC is the lead software developer from July 2013 onwards. Many significant components of khmer have their own paper describing them (see “Use Cases”, above). The remaining authors each have one or more Git commits in their name.

Competing interests: No competing interests were disclosed.

 25 9 2015 2015 4 900 25 9 2015 Copyright: © 2015 Crusoe MR et al. 2015 This is an open access article distributed under the terms of the Creative Commons Attribution Licence, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

The khmer package is a freely available software library for working efficiently with fixed length DNA words, or k-mers. khmer provides implementations of a probabilistic k-mer counting data structure, a compressible De Bruijn graph representation, De Bruijn graph partitioning, and digital normalization. khmer is implemented in C++ and Python, and is freely available under the BSD license at https://github.com/dib-lab/khmer/.

 bioinformatics dna sequencing analysis k-mer kmer khmer online low-memory streaming khmer development has largely been supported by AFRI Competitive Grant no. 2010-65205-20361 from the USDA NIFA, and is now funded by the National Human Genome Research Institute of the National Institutes of Health under Award Number R01HG007513, as well as by the the Gordon and Betty Moore Foundation under Award number GBMF4551, all to CTB. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Introduction

DNA words of a fixed-length k, or “k-mers”, are a common abstraction in DNA sequence analysis that enable alignment-free sequence analysis and comparison. With the advent of second-generation sequencing and the widespread adoption of De Bruijn graph-based assemblers, k-mers have become even more widely used in recent years. However, the dramatically increased rate of sequence data generation from Illumina sequencers continues to challenge the basic data structures and algorithms for k-mer storage and manipulation. This has led to the development of a wide range of data structures and algorithms that explore possible improvements to k-mer-based approaches.

Here we present version 2.0 of the khmer software package, a high-performance library implementing memory- and time-efficient algorithms for the manipulation and analysis of short-read data sets. khmer contains reference implementations of several approaches, including a probabilistic k-mer counter based on the CountMin Sketch 1 , a compressible De Bruijn graph representation built on top of Bloom filters 2 , a streaming lossy compression approach for short-read data sets termed “digital normalization” 3 , and a generalized semi-streaming approach for k-mer spectral analysis of variable-coverage shotgun sequencing data sets 4 .

khmer is both research software and a software product for users: it has been used in the development of novel data structures and algorithms, and it is also immediately useful for certain kinds of data analysis (discussed below). We continue to develop research extensions while maintaining existing functionality.

The khmer software consists of a core library implemented in C++, a CPython library wrapper implemented in C, and a set of Python “driver” scripts that make use of the library to perform various sequence analysis tasks. The software is currently developed on GitHub under https://github.com/dib-lab/khmer, and it is released under the BSD License. There is greater than 87% statement coverage under automated tests, measured on both C++ and Python code but primarily executed at the Python level.

 Methods Implementation

The core data k-mer counting data structures and graph traversal code are implemented in C++, and then wrapped for Python in hand-written C code, for a total of 10.5k lines of C/C++ code. The command-line API and all of the tests are written in 13.7k lines of Python code. C++ FASTQ and FASTA parsers came from the SeqAn library 5 .

Documentation is written in reStructuredText, compiled with Sphinx, and hosted on ReadTheDocs.org.

We develop khmer on github.com as a community open source project focused on sustainable software development 6 , and encourage contributions of any kind. As an outcome of several community events, we have comprehensive documentation on contributing to khmer at https://khmer.readthedocs.org/en/latest/dev/ 7 . Most development decisions are discussed and documented publicly as they happen.

 Operation

khmer is primarily developed on Linux for Python 2.7 and 64-bit processors, and several core developers use Mac OS X. The project is tested regularly using the Jenkins continuous integration system running on Ubuntu 14.04 LTS and Mac OS X 10.10; the current development branch is also tested under Python 3.3, 3.4, and 3.5. Releases are tested against many Linux distributions, including RedHat Enterprise Linux, Debian, Fedora, and Ubuntu. khmer should work on most UNIX derivatives with little modification. Windows is explicitly not supported.

Memory requirements for using khmer vary with the complexity of data and are user configurable. Several core data structures can trade memory for false positives, and we have explored these details in several papers, most notably Pell et al. 2012 2 and Zhang et al. 2014 1 . For example, most single organism mRNAseq data sets can be processed in under 16 GB of RAM 3, 8 , while memory requirements for metagenome data sets may vary from dozens of gigabytes to terabytes of RAM.

The user interface for khmer is via the command line. The command line interface consists of approximately 25 Python scripts; they are documented at http://khmer.readthedocs.org/ under User Documentation. Changes to the interface are managed with semantic versioning 9 which guarantees command line compatibility between releases with the same major version.

khmer also has an unstable developer interface via its Python and C++ libraries, on which the command line scripts are built.

 Use cases

khmer has several complementary feature sets, all centered on short-read manipulation and filtering. The most common use of khmer is for preprocessing short read Illumina data sets prior to de novo sequence assembly, with the goals of decreasing compute requirements for the assembler as well as potentially improving the assembly results.

Prefiltering sequence data for <italic toggle="yes">de novo</italic> assembly with digital normalization

We provide an implementation of a novel streaming “lossy compression” algorithm in khmer that performs abundance normalization of shotgun sequence data. This “digital normalization” algorithm eliminates redundant short reads while retaining sufficient information to generate a contig assembly 3 . The algorithm takes advantage of the online k-mer counting functionality in khmer to estimate per-read coverage as reads are examined; reads can then be accepted as novel or rejected as redundant. This is a form of error reduction, because the net effect is to decrease not only the total number of reads considered for assembly, but also the total number of errors considered by the assembler. Digital normalization results in a decrease of the amount of memory needed for de novo assembly of high-coverage data sets with little to no change in the assembled contigs.

Digital normalization is implemented in the script normalize-by-median.py. This script takes as input a list of FASTA or FASTQ files, which it then filters by abundance as described above; see 3 for details. The output of the digital normalization script is a downsampled set of reads, with no modifications to the individual reads. The three key parameters for the script are the k-mer size, the desired coverage level, and the amount of memory to be used for k-mer counting. The interaction between these three parameters and the filtering process is complex and depends on the data set being processed, but higher coverage levels and longer k-mer sizes result in less data being removed. Lower memory allocation increases the rate at which reads are removed due to erroneous estimates of their abundance, but this process is very robust in practice 1 .

The output of normalize-by-median.py can be assembled using a de novo assembler such as Velvet 10 , IDBA 11 , Trinity 12 or SPAdes 13 .

 K-mer counting and read trimming

Using a memory-efficient CountMin Sketch data structure, khmer provides an interface for online counting of k-mers in streams of reads. The basic functionality includes calculating the k-mer frequency spectrum in sequence data sets and trimming reads at low-abundance k-mers. This functionality is explored and benchmarked in 1 .

Basic read trimming is performed by the script filter-abund.py, which takes as arguments a k-mer countgraph (created by khmer’s load-into-counting.py script) and one or more sequence data files. The script examines each sequence to find k-mers below the given abundance cutoff, and truncates the sequence at the first such k-mer. This truncates reads at the location of substitution errors produced by the sequencing process. When processing sequences from variable coverage data sets, filter-abund.py can also be configured to ignore reads that have low estimated abundance.

K-mer abundance distributions can be calculated using the script abundance-dist.py, which takes as arguments a k-mer countgraph, a sequence data file, and an output filename. This script determines the abundance of each distinct k-mer in the data file according to the k-mer countgraph, and summarizes the abundances in a histogram output.

We recently extended digital normalization to provide a generalized semi-streaming approach for k-mer spectral analysis 4 . Here, we examine read coverage on a per-locus basis in the De Bruijn graph and, once a particular locus has sufficient coverage, call errors or trim bases for all following reads belonging to that graph locus. The approach is “semi-streaming” 4 because some reads must be examined twice. This semi-streaming approach enables few-pass analysis of high coverage data sets. More, the approach also makes it possible to apply k-mer spectral analysis to data sets with uneven coverage such as metagenomes, transcriptomes, and whole-genome amplified samples.

Because our core data structure sizes are preallocated based on estimates of the unique k-mer content of the data, we also provide fast and low-memory k-mer cardinality estimation via the script unique-kmers.py. This script uses the HyperLogLog algorithm to provide a probabilistic estimate of the number of unique k-mers in a data set with a guaranteed upper bound 14 . A manuscript on this implementation is in progress (Irber and Brown, unpublished).

 Partitioning reads into disconnected assembly graphs

We have also built a De Bruijn graph representation on top of a Bloom filter, and implemented this in khmer. The primary use for this so far has been to enable memory efficient graph partitioning, in which reads contributing to disconnected subgraphs are placed into different files. This can lead to an approximately 20-fold decrease in the amount of memory needed for metagenome assembly 2 , and may also separate reads into species-specific bins 15 .

 Reformatting collections of short reads

In support of the streaming nature of this project, our preferred paired-read format is with pairs interleaved in a single file. As an extension of this, we automatically support a “broken-paired” read format where orphaned reads and pairs coexist in a single file. This enables single input/output streaming connections between tools, while leaving our tools compatible with fully paired read files as well as files containing only orphaned reads.

For converting to and from this format, we supply the scripts extract-paired-reads.py, interleave-reads.py, and split-paired-reads.py to respectively extract fully paired reads from sequence files, interleave two files containing read pairs, and split an interleaved file into two files containing read pairs.

In addition, we supply several utility scripts that we use in our own work. These include sample-reads-randomly.py for performing reservoir sampling of reads and readstats.py for summarizing sequence files.

 Summary

The khmer project is an increasingly mature open source scientific software project that provides several efficient data structures and algorithms for analyzing short-read nucleotide sequencing data. khmer emphasizes online analysis, low memory data structures and streaming algorithms. khmer continues to be useful for both advancing bioinformatics research and analyzing biological data.

 Software availability Software available from

https://khmer.readthedocs.org/en/v2.0/

Link to source code

https://github.com/dib-lab/khmer/releases/tag/v2.0

Link to archived source code as at time of publication

http://dx.doi.org/10.5281/zenodo.31258 16

Software license

Michael Crusoe: Copyright: 2010–2015, Michigan State University. Copyright: 2015, The Regents of the University of California. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.

Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

Neither the name of the Michigan State University nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 Zhang Q Pell J Canino-Koning R : These are not the k-mers you are looking for: Efficient online k-mer counting using a probabilistic data structure. PLoS One. 2014;9(7):e101271. 25062443 10.1371/journal.pone.0101271 4111482 Pell J Hintze A Canino-Koning R : Scaling metagenome sequence assembly with probabilistic de Bruijn graphs. Proc Natl Acad Sci U S A. 2012;109(33):13272–7. 22847406 10.1073/pnas.1121464109 3421212 Brown CT Howe A Zhang Q : A reference-free algorithm for computational normalization of shotgun sequencing data. arXiv preprint.2012. Reference Source Zhang Q Awad S Brown CT : Crossing the streams: a framework for streaming analysis of short DNA sequencing reads. PeerJ PrePrints. 2015;3:e1100. 10.7287/peerj.preprints.890v1 Döring A Weese D Rausch T : SeqAn an efficient, generic C++ library for sequence analysis. BMC Bioinformatics. 2008;9(1):11. 18184432 10.1186/1471-2105-9-11 2246154 Crusoe MR Brown CT : Walking the talk: adopting and adapting sustainable scientific software development processes in a small biology lab. figshare. 2013. 10.6084/m9.figshare.791567 Brown CT Crusoe MR : Channeling community contributions to scientific software: a sprint experience. figshare. 2014. 10.6084/m9.figshare.1112541 Lowe EK Swalla BJ Brown CT : Evaluating a lightweight transcriptome assembly pipeline on two closely related ascidian species. PeerJ Preprints. 2014;2. 10.7287/peerj.preprints.505v1 Preston-Werner T : Semantic versioning 2.0.0.2015. [Online; accessed 3-August-2015]. Reference Source Zerbino DR Birney E : Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 2008;18(5):821–9. 18349386 10.1101/gr.074492.107 2336801 Peng Y Leung HCM Yiu SM : IDBA–a practical iterative de Bruijn graph de novo assembler. In Research in Computational Molecular Biology.2010;426–440. 10.1007/978-3-642-12683-3_28 Haas BJ Papanicolaou A Yassour M : De novo transcript sequence reconstruction from RNA-seq using the Trinity platform for reference generation and analysis. Nat Protoc. 2013;8(8):1494–512. 23845962 10.1038/nprot.2013.084 3875132 Bankevich A Nurk S Antipov D : SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing. J Comput Biol. 2012;19(5):455–477. 22506599 10.1089/cmb.2012.0021 3342519 Flajolet P Fusy E Gandouet O : HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. DMTCS Proceedings. 2008; (1). Reference Source Howe AC Jansson JK Malfatti SA : Tackling soil diversity with the assembly of large, complex metagenomes. Proc Natl Acad Sci U S A. 2014;111(13):4904–9. 24632729 10.1073/pnas.1402564111 3977251 Crusoe MR Alameldin HF Awad S : The khmer project v2.0. Zenodo. 2015. Data Source 10.5256/f1000research.7456.r10508 Reviewer response for version 1 Patro Rob 1 Referee https://orcid.org/0000-0001-8463-1675 Computer Science Department, Stony Brook University, Stony Brook, NY, USA

Competing interests: No competing interests were disclosed.

 8 10 2015 Copyright: © 2015 Patro R 2015 This is an open access peer review report distributed under the terms of the Creative Commons Attribution Licence, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. recommendation approve

This paper describes version 2 of the khmer software suite.  The software is developed to provide both a set of directly usable tools (e.g. normalize-by-median for digital normalization) as well as an experimental framework for developers looking to design new algorithms and methods.  It has proven very useful on both of these fronts.  The repository is highly watched and starred on GitHub, the developers are very responsive (see more below), and both the senior author's group and other researches seem to be leveraging this framework to build new tools and algorithms.

The paper itself does a good job of describing the software at a high level, including the overall design and goals.  I would have appreciated slightly more detail about the motivation behind the design decisions, and the tradeoffs they entail (e.g. Why have a Python front-end? Why use hand-written binding code rather than a binding generator, like SWIG, that would allow interfaces to other languages as well?).  I understand that a comprehensive description is not feasible in a manuscript of this length.  It would be very interesting to know, however, the cost paid for using the high-level interface rather than the C++ library directly.  When the underlying computation is trivial, simply having to iterate over an enormous number of things in Python could add non-trivial overhead.  Despite these desiderata, I find that the paper is generally well written and does a good job of describing what a new user might want to know about khmer, and so I approve of this manuscript.

Like Daniel, I also downloaded and built the software using the instructions provided in the ReadTheDocs documentation.  The process was simple, and worked well, with the exception of a minor glitch running the tests.  After debugging the cause of the problem, I posted an issue to the GitHub repository, and received a response in less than a day.  I bring this up because, while not an aspect of the paper itself, good developer support is crucial to the long-term survival and utility of a software package — khmer seems to have this.

This brings me to my final point, about the (currently) controversial authorship policy on this paper, which is ancillary to the quality of the paper (and software) itself.  At this point, I must reserve judgement on whether I think the authorship policy adopted by this paper is "good" or "bad" (for science, the community, etc.).  Incidentally, this is a dichotomy that does not capture the subtlety or importance of this issue well.  In the manuscript, the authors state "We develop khmer on github.com as a community open source project focused on sustainable software development, and encourage contributions of any kind."  Thus, contributions to khmer are of a potentially wide variety in character (and also, I believe, not simply related to improving or maintaining the code).  Those who contribute to the design, improve the usability, work on documentation, support new and existing users, and develop and propagate best practices are all contributing something valuable to the khmer software "ecosystem".  It is unreasonable to expect a piece of software that is ~25k lines of code (and growing) to be actively developed, maintained, and supported by only a small contingent of people, many of whom may be graduate students soon to graduate and move on.  Thus, if we are interested in the long-term viability and quality of such software, we must adopt a system of credit that values and recognizes a variety of different types of contribution.  On the other hand, I do share the concern that, in the midst of the current authorship system, bestowing that recognition in the form of authorship may have the adverse effect of diminishing the public perception of the very credit one is trying to grant.  Perhaps there is a solution  along the lines adopted by this paper, or perhaps something drastically different needs to be considered.

Reviewer Expertise:

NA

I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard.

 10.5256/f1000research.7456.r10513 Reviewer response for version 1 Katz Daniel S. 1 Referee https://orcid.org/0000-0001-5934-7525 Computation Institute, University of Chicago, Chicago, IL, USA

Competing interests: No competing interests were disclosed.

 6 10 2015 Copyright: © 2015 Katz DS 2015 This is an open access peer review report distributed under the terms of the Creative Commons Attribution Licence, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. recommendation approve

Regarding the paper, it is a fairly straightforward description of a software package, containing all the things that such a paper should have - a description of the goals, the implemented methods, the hardware and software dependencies (systems on which the software has been tested), some guidance on usage, pointers to the software and documentation, and references.

Regarding the software, I did download and build the software, which seemed to work, other than a fair number of warnings.  I was not able to successfully test the software, however, due to issues in  https://khmer.readthedocs.org/en/v2.0/user/install.html#run-the-tests  Does this mean I should not approve the article?  Or should I ask the authors for help in understanding the error and hold off on submitting this report?

I would have liked to have chosen "Approved with reservations" for the status of this review, but my reservations are with the F1000 system for this type of paper, not with this specific paper, so in fairness to the authors, given the lack of clarity of what I should be doing as a reviewer for a software paper, I approve this paper based on its quality as a good description of the software, and not on the quality of software (and related documentation) itself.

Reviewer Expertise:

NA

I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard.

Katz Daniel S. University of Illinois at Urbana-Champaign, USA

Competing interests: none

 6 10 2015

In addition to my report, regarding software papers in general under F1000, I believe that much more should be required from their reviewers, and what  is required should be made clear.  Software journals (e.g., Ubiquity Press's Journal of Open Research Software, Elsevier's Software X) have specific statements of what a reviewer should do, which say a lot about the quality of the review.  For JORS, this is defined on a web page ( http://openresearchsoftware.metajnl.com/about/editorialPolicies/).  For Software X, the criteria are not on the web (as far as I know) but are embedded in the review form/process, and are roughly equivalent.

 10.5256/f1000research.7456.r10514 Reviewer response for version 1 Birney Ewan 1 Referee https://orcid.org/0000-0001-8314-8497 European Molecular Biology Laboratory, European Bioinformatics Institute, Hinxton, UK

Competing interests: No competing interests were disclosed.

 5 10 2015 Copyright: © 2015 Birney E 2015 This is an open access peer review report distributed under the terms of the Creative Commons Attribution Licence, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. recommendation approve-with-reservations

This is an update of a widely used tool, khmer, which is in broad use in the technical community around de Bruijn graphs and short reads, based on Bloom filters. It is a good update, provides link to the code, and is sensibly written with tests. I have no concern about the scientific aspect of this paper.

I do find the author inclusion list taking a concept and going to the extreme, and I don't think it is sensible to have an anonymised author (en zyme) on the list, with in effect no way to attribute to a person this. Science's openness in publication is also about attribution. Although I understand Titus' consistency of having all git committers as authors, I think it is sensible to make a distinction of substantial/scientific changes, of which the vast majority of the authors are. Acknowledgements are precisely there to handle these other cases. 

I believe it is uncontroversial to appropriately trim the author list, to use the acknowledgements for anonymous improvement (happens regularly in science) and small details (again, a commonplace practice).

Reviewer Expertise:

NA

I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above.