Result for 26E66531660CC662A8D2FCEC683D18EF1F8F6EA4

Query result

Key Value
FileName./usr/bin/fasta2DAM
FileSize88128
MD5355E70545E7A78DFEE680711B2F8DAC6
SHA-126E66531660CC662A8D2FCEC683D18EF1F8F6EA4
SHA-25611A4352E82A0F8A3659794A2D70E7C19B039AA900B5AC80BFC4A691DB4C60226
SSDEEP1536:ZURvUV8uwouhlmqL7uiIV48fenLMpRxuFHYRzlbDuPtahlKnG7KxxAAUl7ZQ:GRvTX+4LEuamPjG74xy
TLSHT1A6834B659F0A1E16E4CBCF300936E1E6572C5CB322974752EFCD06785B4B68ADF980C6
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
FileSize166084
MD5AAC056FD93971569922734DC5CA7A772
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-18C4A80B8EB1F515AE298EB61ABB3B992E39FAB75
SHA-256865168B623DB364D5265462F19CBBF300F3CD9CBBA37BD8039A645A8809E30B6
Key Value
FileSize165540
MD5909BFAE73833301B13EB140891F00EC7
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-13B64D279E116067B7F55B92C334BDDCD7B22BCC0
SHA-256190ED504CEFE308071DB813E6FC3464B1241F76D705724C1D9C2C318E8ED48D4