forked from smarco/WFA2-lib
-
Notifications
You must be signed in to change notification settings - Fork 0
/
guix.scm
72 lines (67 loc) · 2.15 KB
/
guix.scm
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
;; Set up build environment using GNU Guix packages
;;
;; CC0 license, Pjotr Prins (c) 2022-2023
;;
;; To use this file to build HEAD:
;;
;; guix build -f guix.scm
;;
;; To get a development container (emacs shell will work)
;;
;; guix shell -C -D -f guix.scm
;;
;; For the tests you need /bin/bash. In a container create it with
;;
;; mkdir -p /bin ; ln -s $GUIX_ENVIRONMENT/bin/bash /bin/bash
;;
;; To find tools
;;
;; cd build
;; cmake .. -DCMAKE_MAKE_PROGRAM=make -DCMAKE_C_COMPILER=gcc
;; cmake --build . --verbose
;;
;; and run the tests with
;;
;; env CC=gcc make
;; ./tests/wfa.utest.sh
(use-modules
((guix licenses) #:prefix license:)
(guix gexp)
(guix packages)
(guix git-download)
(guix build-system cmake)
(gnu packages algebra)
(gnu packages autotools)
(gnu packages base)
(gnu packages bash)
(gnu packages compression)
(gnu packages build-tools)
(gnu packages check)
(gnu packages curl)
(gnu packages gcc)
(gnu packages gdb)
(gnu packages llvm)
(gnu packages parallel)
(gnu packages pkg-config)
(srfi srfi-1)
(ice-9 popen)
(ice-9 rdelim))
(define %source-dir (dirname (current-filename)))
(define %git-commit
(read-string (open-pipe "git show HEAD | head -1 | cut -d ' ' -f 2" OPEN_READ)))
(define-public wfa2-lib-git
(package
(name "wfa2-lib-git")
(version (git-version "1.3" "HEAD" %git-commit))
(source (local-file %source-dir #:recursive? #f))
(build-system cmake-build-system)
(inputs
`(("bash" ,bash)
("gdb" ,gdb)))
(native-inputs
`(("pkg-config" ,pkg-config)))
(home-page "https://github.com/smarco/WFA2-lib/")
(synopsis "Library for wavefront aligner")
(description "The wavefront alignment (WFA) algorithm is an **exact** gap-affine algorithm that takes advantage of homologous regions between the sequences to accelerate the alignment process. Unlike to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time `O(ns+s^2)`, proportional to the sequence length `n` and the alignment score `s`, using `O(s^2)` memory (or `O(s)` using the ultralow/BiWFA mode).")
(license license:expat))) ;; MIT license
wfa2-lib-git