Result for 193061B5824105A801E4869EFF66DC666BE4DC3D

Query result

Key Value
FileName./usr/bin/fasta2DAM
FileSize91480
MD55D64E3AEA2A2D67D7D959A054DD515EE
SHA-1193061B5824105A801E4869EFF66DC666BE4DC3D
SHA-2560530C7B62E82F2308355E5D9E6E302E4F8129FDB43C832BFDD13E14DCF925618
SSDEEP1536:KhYrjaPljV3Obq6KrdlovEvRI1bH5C9mNEz16ZdGwEtL8TvKxshCCL4b3CPy7Tiu:KhYrjaPljV3Obq6KrdlovEvRI1bH5UmU
TLSHT1BF931A11AF548FE7D0DBCC700A3EC752A3BCED8A42A9A3B571AC8548B61571B6DD38C4
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
FileSize178152
MD531086E4CD3002A112B47AC2F1F596641
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-1364538A8D63F76E9C5BBB6A5E69AC52FE157F841
SHA-2566F920BBA2A38FAE1F42C267690A2669F2C8FA0E63D04BB9DE84B79B347B2B3AA
Key Value
FileSize178104
MD5B28B945615CD8EF86C84DD28BD446892
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-1003C12AE2FCDE5DDDC4601D5CB4B875E9E3C710A
SHA-25690C08948CDA010BC55E5D894E8BC292C8C60AF376242FB5C14FBF6E88134FD1D