dazzdb 1.0+git20180908.0bd5e07-1 source package in Ubuntu

Changelog

dazzdb (1.0+git20180908.0bd5e07-1) unstable; urgency=medium

  * Team upload.

  [ Jelmer Vernooń≥ ]
  * Use secure copyright file specification URI.

  [ Andreas Tille ]
  * d/watch: Use git mode
  * New Git commit
  * debhelper 11
  * Point Vcs fields to salsa.debian.org
  * Standards-Version: 4.2.1
  * Remove trailing whitespace in debian/copyright
  * hardening=+all

 -- Andreas Tille <email address hidden>  Sun, 28 Oct 2018 10:29:24 +0100

Upload details

Uploaded by:
Debian Med on 2018-10-28
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Eoan release on 2019-04-18 universe misc
Disco release on 2018-11-09 universe misc

Downloads

File Size SHA-256 Checksum
dazzdb_1.0+git20180908.0bd5e07-1.dsc 2.0 KiB c93f1fae46687e699772c784bef768ec814a296f49abbde36fe4a2c800ae1241
dazzdb_1.0+git20180908.0bd5e07.orig.tar.xz 63.1 KiB 490d9e2194781e3bb0c32b0ab88b3ee927f9e4448b842258a24b432e9d8170d8
dazzdb_1.0+git20180908.0bd5e07-1.debian.tar.xz 4.6 KiB 831094175d5e6a801641ffdc599e778ccdcc3db72c5cdf5b31d97fd2961c4fa1

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