A fast and memory efficient algorithm for down-conversion of an HDTV bitstream to an SDTV signal

1999 ◽  
Vol 45 (1) ◽  
pp. 57-61 ◽  
Author(s):  
Wenwu Zhu ◽  
Kyeong Ho Yang ◽  
F.A. Faryar
Keyword(s):  
Efficient Algorithm ◽  
Down Conversion ◽  
Memory Efficient

EFIM: a fast and memory efficient algorithm for high-utility itemset mining

2016 ◽  
Vol 51 (2) ◽  
pp. 595-625 ◽  
Author(s):  
Souleymane Zida ◽  
Philippe Fournier-Viger ◽  
Jerry Chun-Wei Lin ◽  
Cheng-Wei Wu ◽  
Vincent S. Tseng
Keyword(s):  
Efficient Algorithm ◽  
Itemset Mining ◽  
High Utility ◽  
Memory Efficient

scholarly journals BamToCov: an efficient toolkit for sequence coverage calculations

2021 ◽  
Author(s):  
Giovanni Birolo ◽  
Andrea Telatin
Keyword(s):  
Efficient Algorithm ◽  
Minimum Amount ◽  
Reference Region ◽  
Sequence Coverage ◽  
Calculation Algorithm ◽  
Long Reads ◽  
Flexible Integration ◽  
Memory Efficient ◽  
The Ideal

Many genomics applications requires the calculation of nucleotide coverage of a reference or counting how many reads maps in a reference region. Here we present BamToCov, a suite of tools for rapid and flexible coverage calculations relying on a memory efficient algorithm and designed for flexible integration in bespoke pipelines. The tools of the suite will process sorted BAM or CRAM files, allowing to extract coverage information using different filtering approaches. BamToCov tools, unlike existing tools already available, have been developed to require a minimum amount of memory, to be easily integrated in workflows, and to allow for strand-specific coverage analyses. The unique coverage calculation algorithm makes it the ideal choice for the analysis of long reads alignments. The programs and their documentation are freely available at https://github.com/telatin/bamtocov.

Sign in / Sign up

Export Citation Format

Share Document