dazzdb 1.0+20171014-1 source package in Ubuntu

Changelog

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

  * New upstream snapshot (git 8ab7daf)
  * Update and refresh patches
  * Bump Standards-Version to 4.1.1
  * Bump copyright years

 -- Afif Elghraoui <email address hidden>  Fri, 20 Oct 2017 00:00:08 -0400

Upload details

Uploaded by:
Debian Med
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
dazzdb_1.0+20171014-1.dsc 1.9 KiB f240a2f46783a00a54b5c9a0cb6b7e7117c22995ee605857946f78d9fe03c357
dazzdb_1.0+20171014.orig.tar.gz 74.7 KiB 43dd2c972c7d83272c97903935a15924bdf1dd16a0c90708d8ae91d76e2a8d62
dazzdb_1.0+20171014-1.debian.tar.xz 4.4 KiB 9aade951eaed48a7a4840153fea47a6b90c86107c8b1795e496e2da3952f37ae

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