[ 原始碼： dazzdb ]
套件：dazzdb（1.0+git20240115.be65e59-1）
dazzdb 的相關連結
Debian 的資源：
下載原始碼套件 dazzdb：
- [dazzdb_1.0+git20240115.be65e59-1.dsc]
- [dazzdb_1.0+git20240115.be65e59.orig.tar.xz]
- [dazzdb_1.0+git20240115.be65e59-1.debian.tar.xz]
維護小組：
- Debian Med Packaging Team (QA 頁面, 郵件存檔)
- Andreas Tille (QA 頁面)
- Pranav Ballaney (QA 頁面)
- Étienne Mollier (QA 頁面)
外部的資源：
- 主頁 [github.com]
相似套件：
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.