Result for 63357DBF0D4DE16DA6D49B2AD93D70A5BC248E42

Query result

Key Value
FileName./usr/bin/Catrack
FileSize133136
MD5A91C7F3212DE52B2F5897215C7580389
SHA-163357DBF0D4DE16DA6D49B2AD93D70A5BC248E42
SHA-256845AABA4CE46D969F3A5D366A2134FC46D31F87AE4657D9970F7CF4BE59C4C48
SSDEEP1536:gUAOWhYShNbqwbKK7R57yDTGX1Bm+ACEChOE0MwSqz6siX:bAOWhpo6N777tXrLAC/85i
TLSHT1B5D31727248C5B0ADBD2257B478E6D4677A53C1B03B287D6B801035BAFBC739D60AD8D
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