18 Fall | Robotics PhD 申请小结 | 内附个人SoP

一亩三分地论坛

 找回密码
 Sign Up 注册获取更多干货

最近看过此主题的会员

坐标湾区
DreamCraft创始团队
招聘游戏开发工程师
游戏初创公司招聘工程师、UIUX Designer和游戏策划
码农求职神器Triplebyte:
不用海投
内推多家公司面试
前Google华人高管创立
面试offer一键直通
Leap.ai助你进入热门独角兽
查看: 2177|回复: 2
收起左侧

[其他] Twitter OA 求帮忙!

[复制链接] |试试Instant~
我的人缘0
笑眯眯的白云 发表于 2016-10-31 10:24:18 | 显示全部楼层 |阅读模式
本楼: 【顶】   0% (0)
 
 
0% (0)   【踩】
全局: 顶  39% (15)
 
 
60% (23)  踩

2011(1-3月)-[12]CS本科+fresh grad 无实习/全职 - 网上海投| 码农类General其他@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


. From 1point 3acres bbs
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>
复制代码
. From 1point 3acres bbs







补充内容 (2016-10-31 10:25):
刚刚乱码了。. From 1point 3acres bbs

要求写的function 是:
  1. /*
  2. * Complete the function below.
  3. */.本文原创自1point3acres论坛
  4. . 1point3acres
  5.     static int findMutationDistance(String start, String end, String[] bank) {


  6.     }.本文原创自1point3acres论坛

复制代码

补充内容 (2016-10-31 10:31):
要求用JAVA 或者 Python 写

上一篇:小众公司Visa OA 求大神指点第一题解法
下一篇:Twitter OA 求助!。 Java Python 大神请进!
我的人缘0
forteller 发表于 2016-11-1 01:59:24 | 显示全部楼层
本楼: 【顶】   100% (1)
 
 
0% (0)   【踩】
全局: 顶  75% (39)
 
 
25% (13)  踩
Leetcode draft里有原题
回复

使用道具 举报

我的人缘0
 楼主| 笑眯眯的白云 发表于 2016-10-31 10:25:01 | 显示全部楼层
本楼: 【顶】   0% (0)
 
 
0% (0)   【踩】
全局: 顶  39% (15)
 
 
60% (23)  踩
  1. /*
  2. * Complete the function below.
  3. */

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


  5.     }
复制代码


回复

使用道具 举报

游客
请先登录

本版积分规则

提醒:发帖可以选择内容隐藏,部分板块支持匿名发帖。请认真读完以下全部说明:

■隐藏内容方法: [hide=200]你想要隐藏的内容比如面经[/hide]
■意思是:用户积分低于200则看不到被隐藏的内容
■可以自行设置积分值,不建议太高(200以上太多人看不到),也不建议太低(那就没必要隐藏了)
■建议只隐藏关键内容,比如具体的面试题目、涉及隐私的信息,大部分内容没必要隐藏。
■微信/QQ/电子邮件等,为防止将来被骚扰甚至人肉,以论坛私信方式发给对方最安全。
■匿名发帖的板块和方法:http://www.1point3acres.com/bbs/thread-405991-1-1.html

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

GMT+8, 2018-9-21 04:47

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

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