Re: Translation Project

On 30/03/2013, at 2:48 AM, Jeremy Henderson <[e-mail]> =
wrote:

> Thank you very much Regis, Justin, and Julian! I am grateful that you=20=

> have taken the time to not just respond, but to make this educational =
as=20
> well, that is exactly what I was looking for.
>=20
> Regis:
>=20
> I have tested your code on codeacademy labs and it does work on 1.8.3,=20=

> but seems to have a problem with not running multiple times, I believe=20=

> that is an issue with their site though. When running, it works very=20=

> smoothly!
>=20
> Recurring issue with it: It cannot accept apostrophe's. It will lock =
up=20
> the site if an apostrophe is anywhere in the text. Which I will work =
on=20
> resolving.
>=20
> Justin:
>=20
> Up until my conversation with Regis yesterday, I had no coding down,=20=

> just the concept. Knowing that there would be multiple possible=20
> approaches, I was wanting to see at least one possible way that =
someone=20
> knew how to do it, and then assess, reconfigure, rebuild, etc...=20
> whatever needed to be done.
>=20
> My goal is to create an encrypter that mimics DNA sequencing which =
only=20
> uses four letters: A, T, G, C. Wherein there is a rule they must =
follow,=20
> A always pairs with T, and C always pairs with G.
>=20
> So this encrypter would take text, reassign it's values to one of the=20=

> four letters (this assigning could then be changed in a whim if anyone=20=

> ever figured it out), and then spit out the result.
>=20
> =
{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{=

>=20
> The end product would then be to have a way of re-combining everything=20=

> on the receiving end. Which is the hard part. I want it to take the=20
> code, assess the different possible letters, for instance, "You"=20
> translated in the example above WOULD be "DCD", which then =
re-translated=20
> back COULD be any combination of [S,T,U,V,W,X,Y,Z] [M,N,O,P,Q,R]=20
> [S,T,U,V,W,X,Y,Z]. It would need to compare the possible combinations =
to=20
> a dictionary, which would be ranked on the most probable words, and =
then=20
> spit out the most accurate answer.
>=20
> =
{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{=

>=20
> So, there is still a lot of work to do. I just wanted a good footing =
to=20
> base it on. So that's where I'm at now.
>=20
> Julian:
>=20
> Thank you very much for your solution, but also for the detailed=20
> explanation and breakdown! I have learned about a lot of the different=20=

> components you mentioned through Code Academy, but also a lot of them =
I=20
> either haven't gotten to, or they don't teach it. So THANK YOU!
>=20
> I'm going to read through everything bit by bit and see if I can get =
it=20
> to run on code academy labs. Then play with it as need be.
>=20
> Here are the small changes I have made to Regis' solution so far =
(mostly=20
> spacing and rewording of the request for input):
>=20
> $h=3D{
> "A" =3D> %w{A B C D E F},
> "T" =3D> %w{G H I J K L},
> "G" =3D> %w{M N O P Q R},
> "C" =3D> %w{S T U V W X Y Z}
> }
> $reverseh=3D $h.inject({}) { |h,(k,a)| a.each {|l| h[l]=3Dk } ; h }
>=20
> def conv(letter) $reverseh[letter] || letter end
>=20
>=20
> print "DNAS: Sequencing Open... Input? "
> puts " "
> while (word=3D$stdin.gets).size>1
> puts word.chomp.upcase.split(//).map { |l| conv(l) }.join("")
> puts " "
> print "DNAS: Additional Input? "
> puts " "
> end
>=20
>=20
> Again, thank you very much everybody! I don't want anyone to think =
that=20
> I am asking you to do the work for me. I want to learn all of this and=20=

> will do it all myself if it comes to it, it just helps to have solid=20=

> grounding to work with. Not to mention, I will give credit on =
everyone's=20
> contributions at the end of this all and in the final product, unless=20=

> they ask me not to. I'm not here to steal work. :)
>=20
> --=20
> Posted via http://www.ruby-forum.com/.
>=20

class String
def dna_conv
  dict =3D {"A" =3D> "ABCDEF", "B" =3D> "GHIJKL", "C" =3D> "MNOPQR", "D" =
=3D> "STUVWXYZ"}
  self.upcase.each_char.map{|input_char| dict.detect{|key, value| =
value.include?(input_char)}.first}.join
end
end

puts "DNAS: Sequencing Open... Input? "
while (word=3D$stdin.gets.chomp).size>1
  puts word.dna_conv
  puts
  puts "DNAS: Additional Input? "
end

Better?