Result for 2F5FA65C10117AF78DBE85045C057388FFE54981

Query result

Key Value
FileName./usr/bin/arrow2DB
FileSize79220
MD5394E3E0E75656FA182DE67A1C09E8456
SHA-12F5FA65C10117AF78DBE85045C057388FFE54981
SHA-2564A69265418C0D7AD697619EDA35581AEF36DE9F0E5CF24A849BE7F7B4FD35393
SSDEEP1536:f6tZGDk86kk12aXVy7HgXIamu49Gw15xEM8Us/hQPUt+11U:f63GDk8SjXVgHgTmuyNI
TLSHT1BE734B65BB43E0F0F65349F84346A36B1530AA03E123DAAEFB0637D5393A2261D67375
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
FileSize161048
MD54B68F8F2FBE572EFADB64549EAEDEA2A
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-14203DFFFEFFE5BD576F0132CA41A15B0ED548B5C
SHA-2565E4C2D680AF910A99774A574F0BAC47D56941FD91F98AF43D90398B010FE8760