[ 源代码： e-mem ]
软件包：e-mem（1.0.1-4）
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 (>= 4.2)
- GCC 支持库
-
- dep: libgomp1 (>= 4.9)
- GCC OpenMP（GOMP）支持库
-
- dep: libstdc++6 (>= 5.2)
- GNU 标准 C++ 库，第3版
-
- enh: mummer
- Efficient sequence alignment of full genomes