码迷,mamicode.com
首页 >  
搜索关键字:sequence operation    ( 9031个结果
How to prepare a FASTA file for calling SNP by GATK
1, Creating the fasta sequence dictionary filejava -jar CreatSequenceDictionary.jar R=sequencename.fasta O=sequencename.dict2,Creating the fasta index...
分类:其他好文   时间:2014-06-10 12:23:44    阅读次数:335
C++ 异步IO (一) 阻塞式HTTP客户端
An IO call issynchronousif, when you call it, it does not return until the operation is completed, or until enough time has passed that your network s...
分类:编程语言   时间:2014-06-10 10:07:56    阅读次数:273
读书笔记-HBase in Action-第一部分 HBase fundamentals
新项目准备上HBase。HBase目前由组里某牛负责。本着学会使用HBase的目标,先阅读下HBase in Action,学习内容包括HBase基本实现原理,使用方法,Schema设计原则和实战等。借用Michael Stack(HBase Chair)的话,“At a highlevel, HBase is like theatomic bomb. Its basic operation...
分类:其他好文   时间:2014-06-10 06:33:37    阅读次数:328
projecteuler---->problem=25----1000-digit Fibonacci number
问题描述: The Fibonacci sequence is defined by the recurrence relation: Fn = Fn1 + Fn2, where F1 = 1 and F2 = 1. Hence the first 12 terms will be: F1 = 1 F2 = 1 F3 = 2 F4 = 3 F5 = 5 F6 = 8 ...
分类:其他好文   时间:2014-06-10 06:10:06    阅读次数:307
Oracle EBS-SQL (SYS-9):职责使用菜单.sql
select aa.menu_name, aa.user_menu_name, aa.type, aa.description, aa.ENTRY_SEQUENCE, aa.prompt, aa.sub_user_menu_name, aa.user_function_name, aa.des...
分类:数据库   时间:2014-06-09 17:36:37    阅读次数:352
LeetCode:Count and Say
题目链接The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off a...
分类:其他好文   时间:2014-06-09 15:53:03    阅读次数:246
TFIDF文档向量化-Mahout_MapReduce
Mahout之SparseVectorsFromSequenceFiles源码分析目标:将一个给定的sequence文件集合转化为SparseVectors1、对文档分词1.1)使用最新的{@link org.apache.lucene.util.Version}创建一个...
分类:其他好文   时间:2014-06-08 21:56:03    阅读次数:501
Python笔记-Grouping Records Together Based on a Field
Grouping Records Together Based on a Field Problem You have a sequence of dictionaries or instances and you want to iterate over the data in groups based on the value of a...
分类:编程语言   时间:2014-06-08 18:22:29    阅读次数:280
poj 1699 Best Sequence(dfs)
http://poj.org/problem?id=1699 题意:给出n个只含A,C,G,T的字符串,要求能把这n个字符串组合起来的最短长度。 思路:预处理一下,a[i][j]表示将第j个字符串连接到第i个字符串后面增加的长度,那么我们需要找出这样一个序列1,2....n满足a[1][2] + a[2][3] + ...+a[n-1][n]的最小值。DFS就OK了,任选一个字...
分类:其他好文   时间:2014-06-08 17:49:21    阅读次数:199
求斐波那契单词的第n个字符
Definition Let  be "0" and  be "01". Now  (the concatenation of the previous sequence and the one before that). The infinite Fibonacci word is the limit  We have:     0     01     010     01...
分类:其他好文   时间:2014-06-08 09:19:42    阅读次数:273
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!