Search research articles
Contact Us
Filters
Showing results (1-10 of 9) with videos related to
Page
of 1
Sort By:
Entropy (Basel, Switzerland)
|
December 3, 2020
Universality of Logarithmic Loss in Fixed-Length Lossy Compression
Albert No
Entropy (Basel, Switzerland)
|
December 3, 2020
Universality of Logarithmic Loss in Successive Refinement
Albert No
Entropy (Basel, Switzerland)
|
December 3, 2020
Information Geometric Approach on Most Informative Boolean Function Conjecture
Albert No
IEEE Transactions on Information Theory
|
January 30, 2018
Rateless Lossy Compression via the Extremes
Albert No, Tsachy Weissman
BMC Bioinformatics
|
December 21, 2021
FCLQC: fast and concurrent lossless quality scores compressor
Minhyeok Cho, Albert No
BMC Bioinformatics
|
October 1, 2024
Efficient and low-complexity variable-to-variable length coding for DNA storage
Yunfei Gao, Albert No
Journal of Bioinformatics and Computational Biology
|
September 17, 2020
CROMqs: An infinitesimal successive refinement lossy compressor for the quality scores
Albert No, Mikel Hernaez, Idoia Ochoa
Bioinformatics (Oxford, England)
|
September 5, 2023
Reducing cost in DNA-based data storage by sequence analysis-aided soft information decoding of variable-length reads
Seong-Joon Park, Sunghwan Kim, Jaeho Jeong, et al.
Bioinformatics (Oxford, England)
|
April 27, 2021
Cooperative sequence clustering and decoding for DNA storage system with fountain codes
Jaeho Jeong, Seong-Joon Park, Jae-Won Kim, et al.
Page
of 1
Search research articles
Search
Showing results (1-10 of 9) with videos related to
Sort By:
Page
of 1
Entropy (Basel, Switzerland)
|
December 3, 2020
Universality of Logarithmic Loss in Fixed-Length Lossy Compression
Albert No
Entropy (Basel, Switzerland)
|
December 3, 2020
Universality of Logarithmic Loss in Successive Refinement
Albert No
Entropy (Basel, Switzerland)
|
December 3, 2020
Information Geometric Approach on Most Informative Boolean Function Conjecture
Albert No
IEEE Transactions on Information Theory
|
January 30, 2018
Rateless Lossy Compression via the Extremes
Albert No, Tsachy Weissman
BMC Bioinformatics
|
December 21, 2021
FCLQC: fast and concurrent lossless quality scores compressor
Minhyeok Cho, Albert No
BMC Bioinformatics
|
October 1, 2024
Efficient and low-complexity variable-to-variable length coding for DNA storage
Yunfei Gao, Albert No
Journal of Bioinformatics and Computational Biology
|
September 17, 2020
CROMqs: An infinitesimal successive refinement lossy compressor for the quality scores
Albert No, Mikel Hernaez, Idoia Ochoa
Bioinformatics (Oxford, England)
|
September 5, 2023
Reducing cost in DNA-based data storage by sequence analysis-aided soft information decoding of variable-length reads
Seong-Joon Park, Sunghwan Kim, Jaeho Jeong, et al.
Bioinformatics (Oxford, England)
|
April 27, 2021
Cooperative sequence clustering and decoding for DNA storage system with fountain codes
Jaeho Jeong, Seong-Joon Park, Jae-Won Kim, et al.
Page
of 1