《第十四道門 Coraline》
童話故事都是千真萬確的：不是因為它們告訴我們惡龍真的存在，而是因為它們告訴我們，惡龍是可以打敗的。——G．K．切斯特頓
勇敢不代表不害怕，勇敢代表你怕，真的很怕，非常害怕，但你還是作出正確的選擇。
《我的職業是網路小說家：韓國人氣作家的致富寫作教室》
發表於
更新於
我們的競爭對手不是綜合榜的暢銷書，而是YouTube、網路漫畫、遊戲、Netflix等。下班回家的路上，在客滿的地鐵裡用手機看網路小說的讀者，因為周邊環境嘈雜，再加上一整天上班後的疲勞，使得他們的眼睛十分乾澀。你覺得他們會想看哪種句子呢？
讀者要的是趣味性！還有情感的宣洩！以及能夠讓他們忘記苦澀人生的汽水！網路小說家則是販售趣味性的人，所以商業價值當然比文學性來得重要。……網路小說是個完全繞著讀者轉的市場。
鄭穆尼（2021），我的職業是網路小說家：韓國人氣作家的致富寫作教室。
ROSALIND｜Open Reading Frames (ORF)
發表於
給定一條以 FASTA 格式儲存的 DNA 序列，依據它的 open reading frames，列出所有可能由這條 DNA 序列轉譯出的蛋白質序列。
An open reading frame (ORF) is one which starts from the start codon and ends by stop codon, without any other stop codons in between. Thus, a candidate protein string is derived by translating an open reading frame into amino acids until a stop codon is reached.
Given: A DNA string s of length at most 1 kbp in FASTA format.
Return: Every distinct candidate protein string that can be translated from ORFs of s. Strings can be returned in any order.
ROSALIND｜Translating RNA into Protein (PROT)
發表於
轉譯RNA字串為蛋白質字串
Given: An RNA string s corresponding to a strand of mRNA (of length at most 10 kbp).
Return: The protein string encoded by s.
《夏子的冒險》
發表於
更新於
二十歲的松浦夏子是個言出必行的女孩，她有著一旦下定決心便不肯輕言放棄的頑固個性，七歲那年，她受夠了菠菜，她的筷子再也不曾沾過這種蔬菜；等到十五歲時，聽聞他人評論紅色不適合她，夏子便立誓不再穿紅色系的衣服，任誰來勸說也無法動搖她的決心。
（三島由紀夫（1951），夏子的冒險。）
ROSALIND｜Sorting by Reversals (SORT)
發表於
更新於
給定一對數列，計算兩者的最小反轉距離，並依序列出反轉數列的步驟。
A reversal of a permutation can be encoded by the two indices at the endpoints of the interval that it inverts; for example, the reversal that transforms (4,1,2,6,3,5) into (4,1,3,6,2,5) is encoded by [3,5] .
A collection of reversals sorts π into γ if the collection contains drev(π,γ) reversals, which when successively applied to π yield γ .
Given: Two permutations π and γ , each of length 10.
Return: The reversal distance drev(π,γ) , followed by a collection of reversals sorting π into γ . If multiple collections of such reversals exist, you may return any one.
ROSALIND｜Reversal Distance (REAR)
發表於
更新於
給定 5 對長度為 10 的數列，計算將各對數列互相轉換所需的最少反轉次數。
A reversal of a permutation creates a new permutation by inverting some interval of the permutation; (5,2,3,1,4) , (5,3,4,1,2) , and (4,1,2,3,5) are all reversals of (5,3,2,1,4) . The reversal distance between two permutations π and σ , written drev(π,σ) , is the minimum number of reversals required to transform π into σ (this assumes that π and σ have the same length).
Given: A collection of at most 5 pairs of permutations, all of which have length 10.
Return: The reversal distance between each permutation pair.
ROSALIND | Longest Increasing Subsequence (LGIS)
發表於
更新於
給一正整數列，求其最長的遞增與遞減子數列。例如數列 5, 1, 4, 2, 3 的最長遞增數列為 1, 2, 3，最長遞減數列則為 5, 4, 3。
Given: A positive integer n≤10000 followed by a permutation π of length n.
Return: A longest increasing subsequence of π , followed by a longest decreasing subsequence of π.
ROSALIND | Finding a Shared Motif (LCSM)
發表於
更新於
給定一 FASTA 檔案，內含數條由 A、C、G、T 組成的字串，求這些字串共享的最長子字串。
A common substring of a collection of strings is a substring of every member of the collection. We say that a common substring is a longest common substring if there does not exist a longer common substring. For example, “CG” is a common substring of “ACGTACGT” and “AACCGTATA”, but it is not as long as possible; in this case, “CGTA” is a longest common substring of “ACGTACGT” and “AACCGTATA”.
Note that the longest common substring is not necessarily unique; for a simple example, “AA” and “CC” are both longest common substrings of “AACC” and “CCAA”.Given: A collection of k (k≤100) DNA strings of length at most 1 kbp each in FASTA format.
Return: A longest common substring of the collection. (If multiple solutions exist, you may return any single solution.)
ROSALIND | Finding a Motif in DNA (SUBS)
發表於
更新於