Result for 6F469A367C3D3BA54131A45428DB995B6C9E0AFF

Query result

Key Value
FileName./usr/bin/DB2fasta
FileSize133136
MD52B4807886045E8BFF19D31C687ECCB8A
SHA-16F469A367C3D3BA54131A45428DB995B6C9E0AFF
SHA-256B5AC54DA2748544D09F3B62B0C9471DAEE9A061F1D0A99A612512107A8F04D1F
SSDEEP1536:dQFGRV+CqwM7uenL3ItXEdWdLOTmvlqvfVgAG3U:dQFGRklKKwXwWdLOqmM3U
TLSHT1D1D31917248C5B0EDB92257B478EAD4637A13C1703B247D7B901035BAFBDB39E60A98D
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize171852
MD55146894761A3DF267C11528840D3B579
PackageDescriptionmanage 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamedazzdb
PackageSectionscience
PackageVersion1.0+git20180908.0bd5e07-1
SHA-11B112F5EC2F41BD08B1B259A505DD6674B8360C6
SHA-256582E011ED60106C66E9A9931CD15A93F1F24653AE8556EF6E708FB37BE63B2A1