《数据科学面试40+真题讲解》,K神本年度最后一次开课


一亩三分地论坛

 找回密码
 Sign Up 注册获取更多干货
码农求职神器Triplebyte:
不用海投,内推你去多家公司面试
Airbnb 数据科学职位
in analytics and inference
天天打游戏、照样领工资,
你要不要来?
把贵司招聘信息放这里
查看: 1743|回复: 2
收起左侧

[其他] Twitter OA 求帮忙!

[复制链接] |试试Instant~ |关注本帖
笑眯眯的白云 发表于 2016-10-31 10:24:18 | 显示全部楼层 |阅读模式

2011(1-3月)-[12]CS本科+fresh grad 无实习/全职 - 网上海投| 码农类其他@Twitterfresh grad应届毕业生

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看,没有帐号?Sign Up 注册获取更多干货

x
求大神 帮忙!

home / study / engineering / computer science / questions and answers / how do i find mutation in dna using java function? ...
Question: How do I find mutation in DNA using java function?...


Save

鏉ユ簮涓浜.涓夊垎鍦拌鍧.

How do I find mutation in DNA using java function?
An organism's DNA is responsible for how it looks, how it behaves as well as its physiology. Figuring out how genes mutate can help us understand alien evolution as well as treat earthly diseases better. It's the year 2056 & you've obtained a motherload of sequenced genetic material from a research laboratory on Mars. Interesting relationships can be found by studying how genetic sequences are related to one another through mutations. Your task is to write a method - findMutationDistance that takes in this genetic data bank as a large collection of sequences (bank) and the 2 sequences (start & end) whose mutation distance needs to be calculated. This method should return the shortest mutation distance between the two sequences - start and end. If, for whatever reason such a mutation is not possible, the method should return -1.
Constraints:
#1.Martian biological material contains genetic sequences that are all 8 characters in length. The only allowed characters in the sequence are the 4 nucleotide bases of a DNA strand - Adenine, Cytosine, Guanine & Thymine, represented by the letters 'A', 'C', 'T' & 'G'. For eg, 'AATTGGCC' represents a possible genetic sequence in the data bank.
#2. For a sequence to be a part of the mutation distance, it must contain all but 1 of the nucleotide bases as its preceding sequence in the same order AND be present in the bank of valid sequences. For eg. 'AATTGGCC' -> 'AATTGGCA' can be considered a valid mutation if 'AATTGGCA' is present in the bank. Another example of a valid mutation can be 'AATTGGCC' -> 'TATTGGCC' -> 'TTTTGGCC' -> 'TTTTGGCA' if 'TATTGGCC', 'TTTTGGCC' & 'TTTTGGCA' are present in the bank of valid genetic sequences. In this example, the mutation distance is 3, as it took 3 mutations to go from 'AATTGGCC' to 'TTTTGGCA'.
#3. You can assume that the bank will contain unique sequences, and the start sequence may or may not be a part of the bank.
The function is
  1. <p style="margin-bottom: 0.5em; border: 0px; font-variant-numeric: inherit; font-stretch: inherit; line-height: inherit; vertical-align: baseline; max-width: 665px;"></p><p style="margin-bottom: 0.5em; border: 0px; font-variant-numeric: inherit; font-stretch: inherit; line-height: inherit; vertical-align: baseline; max-width: 665px;">static int findMutationDistance(String start, String end, String[] bank) {</p>
复制代码
. more info on 1point3acres.com
.1point3acres缃






补充内容 (2016-10-31 10:25):
刚刚乱码了。

要求写的function 是:
  1. /*
  2. * Complete the function below.
  3. */

  4.     static int findMutationDistance(String start, String end, String[] bank) {


  5.     }

复制代码

补充内容 (2016-10-31 10:31):
要求用JAVA 或者 Python 写
forteller 发表于 2016-11-1 01:59:24 | 显示全部楼层
Leetcode draft里有原题
回复 支持 1 反对 0

使用道具 举报

 楼主| 笑眯眯的白云 发表于 2016-10-31 10:25:01 | 显示全部楼层
  1. /*. 1point3acres.com/bbs
  2. * Complete the function below.
  3. */

  4.     static int findMutationDistance(String start, String end, String[] bank) {


  5.     }
复制代码
. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴

回复 支持 反对

使用道具 举报

本版积分规则

关闭

一亩三分地推荐上一条 /5 下一条

手机版|小黑屋|一亩三分地论坛声明

custom counter

GMT+8, 2017-11-25 06:50

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

快速回复 返回顶部 返回列表