Result for 20692CA727C894080D72CB0726D9D367C1EF78B8

Query result

Key Value
FileName./usr/bin/fasta2DAM
FileSize75400
MD516C36E57D979A27FDBA9E31B308049E2
SHA-120692CA727C894080D72CB0726D9D367C1EF78B8
SHA-256AC3A3C65DA1DF5D69EA1AEABF65A3CB8BF8B6F49567BD0D3D3A635088E26E474
SSDEEP1536:Wtk5dn2YfTwYeVsBWf7M3Qw4zTM+46FqrRV:WWnjTwYKkx4ep9V
TLSHT182734BA2A343E4F1D39349F84747D63B19306603A027E192F7463FD9B93A2176D533A6
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
FileSize138228
MD56098BD1B2144AB7BEB16935AF8EBB275
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+20161112-2
SHA-117415326C48CFA16EF89198255BE2CE6438E7CFF
SHA-2561757E54C2813D8D7C294543EB0362972C8635D56AACBD04B081AC5AFEB01215C