814719fdaa0d

Merge.
[view raw] [browse files]
author Steve Losh <steve@stevelosh.com>
date Fri, 20 Dec 2019 16:23:59 -0500
parents ad32169fc54c (current diff) f94bcb404676 (diff)
children 049e0d632763
branches/tags (none)
files src/utils.lisp

Changes

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/problems/long.lisp	Fri Dec 20 16:23:59 2019 -0500
@@ -0,0 +1,39 @@
+(in-package :rosalind)
+
+(defparameter *input-long*
+  ">Rosalind_56
+ATTAGACCTG
+>Rosalind_57
+CCTGCCGGAA
+>Rosalind_58
+AGACCTGCCG
+>Rosalind_59
+GCCGGAATAC")
+
+(defparameter *output-long*
+  "ATTAGACCTGCCGGAATAC")
+
+
+(defun overlap (left right)
+  "Return the number of overlapping characters in `left` and `right`."
+  (iterate
+    (for size :from (min (length left) (length right)) :downto 0)
+    (for i = (- (length left) size))
+    (finding size :such-that (string= left right :start1 i :end2 size))))
+
+(defun join-overlapping (left right)
+  "Join `left` and `right` together, overlapping as much as possible."
+  (concatenate 'string left (subseq right (overlap left right))))
+
+
+(define-problem long (data stream)
+    *input-long*
+    *output-long*
+  (let* ((dna (mapcar #'cdr (read-fasta-into-alist data)))
+         (graph (digraph:make-digraph :initial-vertices dna :test #'equal)))
+    (dolist (left dna)
+      (dolist (right dna)
+        (when (and (not (equal left right))
+                   (> (overlap left right) (floor (length left) 2)))
+          (digraph:insert-edge graph right left)))) ; reversed edges for toposort
+    (reduce #'join-overlapping (digraph:topological-sort graph))))
--- a/src/utils.lisp	Fri Dec 20 16:23:36 2019 -0500
+++ b/src/utils.lisp	Fri Dec 20 16:23:59 2019 -0500
@@ -298,7 +298,7 @@
   `vars` must be a list of two symbols that will be bound to the label and data,
   respectively, on each iteration.
 
-  `stream` can be either a string or a character input stream.
+  `source` can be either a string or a character input stream.
 
   `generate` is supported.