tag:blogger.com,1999:blog-69306807275780288852011-11-17T18:22:41.228+09:00SCBnoreply@blogger.comBlogger9125tag:blogger.com,1999:blog-6930680727578028885.post-47799439712086272602011-11-17T18:19:00.000+09:002011-11-17T18:20:06.845+09:002011-11-17T18:20:06.845+09:00

The age of a single cell assembly has become. Every assembler will be reconstructed to focus on the single cell assembly. Picking up the pieces: Picking up the pieces Nature Methods 8, 896 (2011). doi:10.1038/nmeth.1753 Author: Michael Eisenstein An improved algorithm for genomic analysis allows scientists to build remarkably accurate and complete genomic sequences from single

SCBnoreply@blogger.com0tag:blogger.com,1999:blog-6930680727578028885.post-37940938162589358392011-11-17T18:07:00.000+09:002011-11-17T18:12:50.127+09:002011-11-17T18:12:50.127+09:00

The sequencing the domestic dog genome with RNA-Seq technology!! RNA-Seq.. Now, for genetic research, I don't know that RNA-Seq has to be implemented necessarily with NGS sequencing. But, the money and time cost to analyze the data are the problem. Annotation of the domestic dog genome sequence: finding the missing genes.: Annotation of the domestic dog genome sequence: finding

SCBnoreply@blogger.com0tag:blogger.com,1999:blog-6930680727578028885.post-4302234092216641542011-11-14T14:38:00.001+09:002011-11-14T14:58:09.934+09:002011-11-14T14:58:09.934+09:00

After k times shift, the algorithm to find common elements between two sets. D(k) is the maximum common elements between two sets after k times shift. [Example] We assume that one shift is that each element, from 6th element to nth element, will subtract 5. Set A = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100} Set B = {10, 30, 30, 40, 50, 55, 65, 75, 85, 95} Set C = {10, 15, 30, 35, 50, 55,

SCBnoreply@blogger.com0tag:blogger.com,1999:blog-6930680727578028885.post-108608452979279412011-11-14T11:14:00.001+09:002011-11-14T23:09:08.805+09:002011-11-14T23:09:08.805+09:00

Recently, de Bruijn graph theory has widely used in the filed of genome assembly. Expecially, Velvet assembler is based on this graph theory. The goal of De Bruijn graph is to make superstring through overlapping k - 1 suffix sequence. So this concept can well match with assembly of short reads of a genome. de Bruijn graph sample (cited from Wikipedia) How can de Bruijn graph make a

SCBnoreply@blogger.com0tag:blogger.com,1999:blog-6930680727578028885.post-78421581056280022002011-11-10T15:45:00.000+09:002011-11-10T15:45:05.593+09:002011-11-10T15:45:05.593+09:00

In case of uncultured bacterial genome, NGS sequencers don't archive sequencing yet. However, the multiplie displacement amplification (MDA, Go to Wikipedia and See this paper) method can be available. MDA method is useful at the single cell but it might encounter amplification bias and chimeras. Amplification bias is caused from the irregular coverage of amplified sequences and chimeras

SCBnoreply@blogger.com0tag:blogger.com,1999:blog-6930680727578028885.post-27119256238703558352011-11-08T18:36:00.001+09:002011-11-08T18:36:47.091+09:002011-11-08T18:36:47.091+09:00

I had known that 'AC' is unique like 'ID' in swissprot. But, it was not true. Moreover, there were multiple 'AC's in one 'ID'. Oooops!!

SCBnoreply@blogger.com0tag:blogger.com,1999:blog-6930680727578028885.post-27659459728224526722011-11-07T03:59:00.000+09:002011-11-07T04:01:12.699+09:002011-11-07T04:01:12.699+09:00

Slightly, I am having some clues for developing iOS application with Xcode. Ha~. But, I still feel much difficulties.

SCBnoreply@blogger.com0tag:blogger.com,1999:blog-6930680727578028885.post-52741326003001960882011-11-05T15:03:00.001+09:002011-11-05T15:06:15.329+09:002011-11-05T15:06:15.329+09:00

With mac mini, I started iOS application development. Unlike other GUI programming, I am feeling that it's too hard. Actually, xcode development toolkit is not intuitive. Maybe I am not good at using xcode.

SCBnoreply@blogger.com0tag:blogger.com,1999:blog-6930680727578028885.post-38316512065965234622011-11-02T15:39:00.000+09:002011-11-03T09:14:40.535+09:002011-11-03T09:14:40.535+09:00

Ho.... The PatchMatch Randomized Matching Algorithm for Image Manipulation | November 2011 | Communications of the ACM

SCBnoreply@blogger.com0