1. kleinstein-lab Avatar kleinstein-lab
  2. B Cell Repertoires
  3. presto

Issues

Filter by:

Advanced search

Issues (26–50 of 56)

Title T P Status Votes Assignee Created Updated Actions
#57: Add check to AssemblePairs for reads shorter than --minlen
bug trivial resolved
#23: Need UID clustering script
enhancement major resolved 1
#31: Add sniff mode to ConvertHeaders
enhancement minor wontfix
#56: Add AbSeq workflow to docs
enhancement minor resolved
#53: EstimateError.py pandas bug.
bug major resolved
#37: Separate required and option arguments in help
enhancement minor resolved
#54: fastq file has unrecognized type
enhancement minor resolved
#49: Add align-to-reference rollover mode to AssemblePairs
enhancement major resolved
#46: Allow AssemblePairs-reference to use gapped references
enhancement major resolved
#45: Replace usearch with an open source tool in AssemblePairs-reference
enhancement major resolved
#47: presto.Application API docs are not rendering correctly
bug trivial resolved
#17: Check for usearch and muscle in PATH first
enhancement trivial resolved
#43: Verify vsearch compatibility
enhancement minor resolved
#38: Verify installation using setup.py works in Windows
bug major wontfix
#35: Windows sdist won't install due to junk in SOURCES.txt
bug major resolved
#13: AssemblePairs-reference : option to fill in nt from reference for gapped stitch
enhancement minor resolved
#30: Update options in examples
bug major resolved
#7: Autogenerate commandline reference documentation with Sphinx
enhancement major resolved
#29: Convert README to restructuredText
bug trivial resolved
#27: Add subcommand to ParseHeader that merges fields
enhancement minor resolved
#4: Update package to Python 3 compatibility
enhancement minor resolved
#18: diversity calculation quality-aware ?
enhancement trivial resolved
#21: Check pip version in setup.py
bug trivial resolved
#20: maskPrimers gapped alignment penalties
enhancement minor resolved
#3: BuildConsensus log output doesn't convey --maxmiss results
bug minor resolved
  2. 1
  3. 2
  4. 3