Result for 39B3D4B0E1AB84BDF366A6E06269740B634F3897

Query result

Key Value
FileName./usr/bin/DB2fasta
FileSize71784
MD5900D3FF5EBE7DC96B16EE0CB3BDE7B9E
SHA-139B3D4B0E1AB84BDF366A6E06269740B634F3897
SHA-256DB47ACF77BA26A6646929AF95E45A8E012A92181D9E57C101687E7B7CAF6CE1F
SSDEEP1536:M/DnUMTTShJ9vogpC69EeYSjc602sq7RzWf+Jnt:M/hShfwZReYSYh2sq7RVlt
TLSHT1E5635CADFD4F7899D18BE278DB4D1120712B399CE36394A3B902936D70DEBCD8AB1414
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
FileSize184256
MD57AD4A3324551D0C5DCE0853FF6C173BF
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-1EFF0098C5D1DE070721CD741B81DD23BFEEF91B3
SHA-256BEAFE8A207270EC8DFA670225D4ABCD01FB88A9253CB9A601EF7C059D520A14A
Key Value
FileSize184308
MD528D5853E77DDF1CB38F17FB5EBD2AEDC
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-1510CCA2E3C6AD0F3ED8AE448DF917A9F1368812B
SHA-25688EE646674D69A58EE1BDB740545F0076147A7EFFFE50C442BE495364855C94C