Result for 1A47724D9BFC2B3F35130D122B58658A3F6A5CB4

Query result

Key Value
FileName./usr/bin/DAM2fasta
FileSize87544
MD50FE1C5FC2AC88CE68014CA27523C48BA
SHA-11A47724D9BFC2B3F35130D122B58658A3F6A5CB4
SHA-256220B9CACC26F777902D13EC9A90D433A85F8CF510C1158DF6DD7EB5C618C1AB5
SSDEEP1536:OWtTKv/m291OWAtx1L7YTVz1aFnS2qrouAtbkrRFsI3HCe:OWRb2qttx1gVEQrsuAtoFi
TLSHT1B4833AA8BF87D4F5F29345F98A86D36B1A308901B113F594FE0A2AC679393162D37235
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
FileSize217084
MD59968534CD8FC64CAED524606591AF27D
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.
PackageMaintainerDebian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageNamedazzdb
PackageSectionscience
PackageVersion1.0+git20221215.aad3a46-1
SHA-155C471166C67EF69684075364F818BFA4DE7FA58
SHA-256ED63E626FEB238B1A8A13977C84EBCC48B3053CD6C671B751DC9AFAE22C57D49