|
I have since been able to figure out my problems - the algorithm for one of
my methods was wrong and I found two "typos" so to speak. I now need to
figure out how to return all optimal solutions, and I have an idea as to how to
start. If I have any more problems I may send out another email.
Rachel
P.S. I need to solve the problem using functional programming,
thus I cannot use looping structures or mutation.
-----Original Message-----
From: Iavor S.
Diatchki [mailto:[EMAIL PROTECTED]
Sent: Tue 3/25/2003 2:45 PM
To: Weix, Rachel Lynn
Cc: [EMAIL PROTECTED]
Subject: Re: Haskell help!
hi,
i think you might find the following paper
relevant:
"Algebrainc Dynamic Prorgamming"
by Robert Gigerich and
Carsten Meyer
http://link.springer-ny.com/link/service/series/0558/papers/2422/24220349.pdf
bye
iavor
Weix,
Rachel Lynn wrote:
> Hi,
>
> I'm a college student
trying to write a Haskell program, and I'm having
> some problems
getting the correct output. I need to write a program
> which will
return a set of optimally aligned sequences, with "optimal"
> being
defined as such: mismatch or space (represented by a "-") = -1;
> else 1
for every pair (see below for what a pair is)
>
> An example
set of sequences with an alignment of -3 is as follows:
>
>
sc-h-e-me
> icecream-
>
> (s,i) are a pair, (c, c),
etc.
>
> For right now, I'm only returning a potential
solution (vs. a set of
> solutions), and I'm having problems with any
set of sequences that
> aren't the same length. My results are
listed below. I don't want to
> include the code for now since
it's about a page long (printed out) but
> was hoping maybe someone had
an idea as to why I'm getting such odd
> results? If code will
help, I can exchange back and forth with whoever
> thinks they might be
able to help me out. Your help is much
>
appreciated!
>
> Rachel
>
>
>
-- Each word/sequence you see has been predefined in my Haskell code
>
-- This first example appears to work just fine
>
> Main>
printSeq icecream scheme
>
> ("icecream",
"scheme--")
>
>
>
> Main> printSeq hate
hatter
>
> ("hat-e", "hatte")
>
>
>
>
Main> printSeq scheme saturn
>
> ("scheme",
"saatur")
>
>
>
> Main> printSeq saturn
scheme
>
> ("saaturn", "scheme-")
>
>
>
>
Main> printSeq saturn hatter
>
> ("saaturn",
"hatter-")
>
>
>
> Main> printSeq hatter
saturn
>
> ("hatter", "saatur")
>
>
>
>
Main> printSeq mad saturn
>
> ("mad",
"saa")
>
>
>
> Main> printSeq hate
hatter
>
> ("hat-e", "hatte")
>
>
>
>
Main> printSeq snowball icecream
>
> ("snowb-all",
"icecream-")
>
>
>
> Main> printSeq mad
computer
>
> ("--mad",
"compu")
>
>
>
> Main> printSeq mad
snowball
>
> ("mad",
"sno")
>
>
--
==================================================
|
Iavor S. Diatchki, Ph.D.
student
|
| Department of Computer Science and Engineering |
| School of OGI at
OHSU
|
| http://www.cse.ogi.edu/~diatchki
|
==================================================
|
