Parents (Total: 33)

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

Key	Value
FileSize	178104
MD5	B28B945615CD8EF86C84DD28BD446892
PackageDescription	manage 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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	dazzdb
PackageSection	science
PackageVersion	1.0+git20201103.8d98c37-1+deb11u1
SHA-1	003C12AE2FCDE5DDDC4601D5CB4B875E9E3C710A
SHA-256	90C08948CDA010BC55E5D894E8BC292C8C60AF376242FB5C14FBF6E88134FD1D

Key	Value
FileSize	209744
MD5	1F9C74E90F200A3F410BAEA7D0F5B4AA
PackageDescription	manage 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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	dazzdb
PackageSection	science
PackageVersion	1.0+git20201103.8d98c37-1+deb11u1
SHA-1	03A15530972D8E5118F316404A11603D69E1BE13
SHA-256	CD9D950C61320CC1075345393847D025535E803FBA921A3DDC1029437F4DE3D3

Key	Value
FileSize	183184
MD5	BF923E85C90F8E770BBA6D2162E5ACC7
PackageDescription	manage 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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	dazzdb
PackageSection	science
PackageVersion	1.0+git20201103.8d98c37-1.1+b1
SHA-1	1011C91FC167030A0902204ABD9FE81F5D3D8BEB
SHA-256	6DED8CE19D0463CBDF0467EE07F2EC99D89810DFE9ECE9FAF06A185811796441

Key	Value
FileSize	178152
MD5	31086E4CD3002A112B47AC2F1F596641
PackageDescription	manage 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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	dazzdb
PackageSection	science
PackageVersion	1.0+git20201103.8d98c37-1
SHA-1	364538A8D63F76E9C5BBB6A5E69AC52FE157F841
SHA-256	6F920BBA2A38FAE1F42C267690A2669F2C8FA0E63D04BB9DE84B79B347B2B3AA

Key	Value
FileSize	165540
MD5	909BFAE73833301B13EB140891F00EC7
PackageDescription	manage 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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	dazzdb
PackageSection	science
PackageVersion	1.0+git20201103.8d98c37-1+deb11u1
SHA-1	3B64D279E116067B7F55B92C334BDDCD7B22BCC0
SHA-256	190ED504CEFE308071DB813E6FC3464B1241F76D705724C1D9C2C318E8ED48D4

Key	Value
FileSize	200504
MD5	301D42C05AED189920479B51F25C9691
PackageDescription	manage 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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	dazzdb
PackageSection	science
PackageVersion	1.0+git20201103.8d98c37-1+deb11u1
SHA-1	3CE10A3E8406E328373E55C4793B953D7C1A6E9A
SHA-256	86CFE7B9DD9005FFFA53D3987C128D89BCF442FC976F0948028EBA1806F8AA6A

Key	Value
FileSize	196772
MD5	FCEA199760B1A84FC51A9564D5671B1C
PackageDescription	manage 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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	dazzdb
PackageSection	science
PackageVersion	1.0+git20201103.8d98c37-1
SHA-1	4B24E7FF793FE24000A0957A78BE110D5711B01C
SHA-256	659D3719BBE6B8A14A9D60B9C0C706F8D52C73F26B371E29DE079B9999916DA3

Key	Value
FileSize	184308
MD5	28D5853E77DDF1CB38F17FB5EBD2AEDC
PackageDescription	manage 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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	dazzdb
PackageSection	science
PackageVersion	1.0+git20201103.8d98c37-1+deb11u1
SHA-1	510CCA2E3C6AD0F3ED8AE448DF917A9F1368812B
SHA-256	88EE646674D69A58EE1BDB740545F0076147A7EFFFE50C442BE495364855C94C

Key	Value
FileSize	204928
MD5	9DC6788965A00A70D09692F8B7A72FB4
PackageDescription	manage 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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	dazzdb
PackageSection	science
PackageVersion	1.0+git20201103.8d98c37-1
SHA-1	557E9297DCDA209B071729C87A8B2B0B63D1A512
SHA-256	B30B3E39C57555E63F7E7BEF56FCF4279BA67152A1C91B0573A14F3AD39A9A1C

Key	Value
FileSize	217084
MD5	9968534CD8FC64CAED524606591AF27D
PackageDescription	manage 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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	dazzdb
PackageSection	science
PackageVersion	1.0+git20221215.aad3a46-1
SHA-1	55C471166C67EF69684075364F818BFA4DE7FA58
SHA-256	ED63E626FEB238B1A8A13977C84EBCC48B3053CD6C671B751DC9AFAE22C57D49