[ 原始碼： e-mem ]
套件：e-mem（1.0.1-5）
Efficient computation of Maximal Exact Matches for very large genomes
E-MEM enables efficient computation of Maximal Exact Matches (MEMs) that does not use full text indexes. The algorithm uses much less space and is highly amenable to parallelization. It can compute all MEMs of minimum length 100 between the whole human and mouse genomes on a 12 core machine in 10 min and 2 GB of memory; the required memory can be as low as 600 MB. It can run efficiently genomes of any size. Extensive testing and comparison with currently best algorithms is provided.
Mummer has many different scripts where one of the key program is MEM computation. In all the scripts, the MEM computation program can be replaced with e-mem with ease for better performance.
其他與 e-mem 有關的套件
|
|
|
|
-
- dep: libc6 (>= 2.4)
- GNU C 函式庫：共用函式庫
同時作為一個虛擬套件由這些套件填實： libc6-udeb
-
- dep: libgcc-s1 (>= 3.5)
- GCC 支援函式庫
-
- dep: libgomp1 (>= 4.9)
- GCC OpenMP (GOMP) support library
-
- dep: libstdc++6 (>= 5.2)
- GNU Standard C++ Library v3
-
- enh: mummer
- Efficient sequence alignment of full genomes