Result for 756DCE269D5D5207E5BCEF1A6A5D2EC7C93D725B

Query result

Key Value
FileName./usr/bin/DBmv
FileSize79976
MD5CC9039CDCDF701F402F814F5DEAB5DA2
SHA-1756DCE269D5D5207E5BCEF1A6A5D2EC7C93D725B
SHA-256E7796CB546F0F0BB8CE0478536CC5044E8F1EAC2EF6139DCF2463F6FAFC27E0E
SSDEEP1536:6cP+Ma6TV0T8AAMImr62RRzB9aeAzPLJtLQ2e5p8XRHs9YpKMM:p+MaeV/IFnBzArLJtkKBHmYQX
TLSHT1D573089B6632C5EAD1717BB3825EABB3932335391BC70F1CAF5EC70154F26414A04AB6
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

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

Key Value
FileSize205564
MD548FAFDC4A65A5A4B6E57BE29D68BB6BE
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+git20201103.8d98c37-1+deb11u1
SHA-1F7E148BED04CB7FD92C40B5678D37730E8FDFD95
SHA-256168C030E3574D9C092C30A88264EAD33B1AC77DFA6E6B3D68BF92C21D64662EA
Key Value
FileSize204928
MD59DC6788965A00A70D09692F8B7A72FB4
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+git20201103.8d98c37-1
SHA-1557E9297DCDA209B071729C87A8B2B0B63D1A512
SHA-256B30B3E39C57555E63F7E7BEF56FCF4279BA67152A1C91B0573A14F3AD39A9A1C