dazzdb 1.0+20180115-1 source package in Ubuntu


dazzdb (1.0+20180115-1) unstable; urgency=medium

  * New upstream snapshot (git 7104852)
  * Bump copyright years
  * Bump Standards-Version to 4.1.3
  * Update and refresh patches

 -- Afif Elghraoui <email address hidden>  Sun, 04 Feb 2018 13:43:31 -0500

Upload details

Uploaded by:
Debian Med on 2018-02-04
Uploaded to:
Original maintainer:
Debian Med
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Cosmic release on 2018-05-01 universe misc
Bionic release on 2018-02-05 universe misc


File Size SHA-256 Checksum
dazzdb_1.0+20180115-1.dsc 1.9 KiB ba169752f1ba033cc8b393591b05b909112368f6b156b5e352b183510a206ab2
dazzdb_1.0+20180115.orig.tar.gz 80.1 KiB 13e6b0a593a1f5d03827e747b7da6fc8e4a011a15376392c03e6c98a259b75e3
dazzdb_1.0+20180115-1.debian.tar.xz 4.4 KiB 9ff515038ad21d8a703c2133d02f38008655454bdda0751016840777b0ec73db

Available diffs

No changes file available.

Binary packages built by this source

dazzdb: manage nucleotide sequencing read data

 To facilitate the multiple phases of the dazzler assembler, all the read data
 is organized into what is effectively a database of the
 reads and their meta-information. The design goals for this data base
 are as follows:
  * The database stores the source Pacbio read information in such a
    way that it can re-create the original input data, thus permitting
    a user to remove the (effectively redundant) source files. This
    avoids duplicating the same data, once in the source file and once
    in the database.
  * The data base can be built up incrementally, that is new sequence
    data can be added to the data base over time.
  * The data base flexibly allows one to store any meta-data desired for
    reads. This is accomplished with the concept of *tracks* that
    implementors can add as they need them.
  * The data is held in a compressed form equivalent to the .dexta and
    .dexqv files of the data extraction module. Both the .fasta and
    .quiva information for each read is held in the data base and can be
    recreated from it. The .quiva information can be added separately and
    later on if desired.
  * To facilitate job parallel, cluster operation of the phases of the
    assembler, the database has a concept of a *current partitioning* in
    which all the reads that are over a given length and optionally
    unique to a well, are divided up into *blocks* containing roughly a
    given number of bases, except possibly the last block which may have
    a short count. Often programs can be run on blocks or pairs of blocks
    and each such job is reasonably well balanced as the blocks are all
    the same size. One must be careful about changing the partition
    during an assembly as doing so can void the structural validity of
    any interim block-based results.

dazzdb-dbgsym: debug symbols for dazzdb