곰탱이의 공부정리

https://www.acmicpc.net/problem/1149  이 문제는 RGB 거리에 직선으로 나열되어 있는 집들이 빨강,초록,파랑 색 중 하나로 색칠 되는데 서로 이웃인 집의 색깔은겹쳐서는 안 되고, 집마다, 색마다 색칠하는 비용이 주어지고, 모든 집을 규칙대로 칠했을 때 최소비용으로 색칠했을 때의 최소비용을 구하는 문제이다.  이 문제는 얼핏보면 모든 경우의 수를 구해서 최솟값을 구하는것 같다만 경우의 수만 3x2의 n승인지라 시간을 무조건 초과하게 되어있다. 이 때 우리는 여기서 다이나믹프로그래밍을 이용하여, 시간을 초과하지 않을 수 있다.  필자는 다이나믹 프로그래밍으로 풀겠다는 느낌은 일종의 매트릭스를 만들어 기록하며 훑으며 처리할 수 있고, 이 처리라는 것이 모든 인덱스에서 똑같이 시행..

https://rosalind.info/problems/cntq/ ROSALIND | Counting QuartetsIt appears that your browser has JavaScript disabled. Rosalind requires your browser to be JavaScript enabled. Counting Quartets solved by 245 2012년 12월 4일 7:10:22 오전 by Rosalind Team Topics: Combinatorics, Phylogeny Introduction to Quartet-Basedrosalind.info  이 문제는 unrooted binary tree에 있는 leaf의 개수와 newick 형식으로 나타내진 tree가 주어지고 이 중..

https://rosalind.info/problems/chbp/ ROSALIND | Character-Based PhylogenyIt appears that your browser has JavaScript disabled. Rosalind requires your browser to be JavaScript enabled. Character-Based Phylogeny solved by 229 2012년 7월 2일 12:00:00 오전 by Rosalind Team Topics: Phylogeny Introduction to Character-Based Phylrosalind.info  이 문제는 서로 모순되지 않는 복수의 charactor table이 주어진 후, newick 형식으로 tree를 제..

ProblemFigure 1. The suffix tree for s = GTCCGAAGCTCCGG. Note that the dollar sign has been appended to a substring of the tree to mark the end of s. Every path from the root to a leaf corresponds to a unique suffix of GTCCGAAGCTCCGG, and each leaf is labeled with the location in s of the suffix ending at that leaf.Given a string s">ss having length n">nn, recall that its suffix tree T(s)">T(s)T..

https://rosalind.info/problems/sgra/ ROSALIND | Using the Spectrum Graph to Infer PeptidesIt appears that your browser has JavaScript disabled. Rosalind requires your browser to be JavaScript enabled. Using the Spectrum Graph to Infer Peptides solved by 533 Getting Real with Spectra In “Inferring Peptide from Full Spectrum”, we considered arosalind.infoProblemFor a weighted alphabet A">AA and a ..

ProblemA partial split of a set S">SS of n">nn taxa models a partial character and is denoted by A∣B">A∣BA∣B, where A">AA and B">BB are still the two disjoint subsets of taxa divided by the character. Unlike in the case of splits, we do not necessarily require that A∪B=S">A∪B=SA∪B=S; (A∪B)c">(A∪B)c(A∪B)c corresponds to those taxa for which we lack conclusive evidence regardi..

https://rosalind.info/problems/prsm/ ROSALIND | Matching a Spectrum to a ProteinIt appears that your browser has JavaScript disabled. Rosalind requires your browser to be JavaScript enabled. Matching a Spectrum to a Protein solved by 592 Searching the Protein Database Many proteins have already been identified for a wide variety of orrosalind.infoProblemThe complete spectrum of a weighted string..

https://rosalind.info/problems/pcov/ ROSALIND | Genome Assembly with Perfect CoverageIt appears that your browser has JavaScript disabled. Rosalind requires your browser to be JavaScript enabled. Genome Assembly with Perfect Coverage solved by 825 Cyclic Chromosomes Recall that although chromosomes taken from eukaryotes have a linear strucrosalind.infoProblemA circular string is a string that do..

https://rosalind.info/problems/glob/ ROSALIND | Global Alignment with Scoring MatrixIt appears that your browser has JavaScript disabled. Rosalind requires your browser to be JavaScript enabled. Global Alignment with Scoring Matrix solved by 868 Generalizing the Alignment Score The edit alignment score in “Edit Distance Alignment” courosalind.infoProblemTo penalize symbol substitutions different..

https://rosalind.info/problems/cunr/ ROSALIND | Counting Unrooted Binary TreesIt appears that your browser has JavaScript disabled. Rosalind requires your browser to be JavaScript enabled. Counting Unrooted Binary Trees solved by 433 2012년 7월 2일 12:00:00 오전 by Rosalind Team Topics: Combinatorics, Phylogeny Counting Trees Arosalind.infoProblemTwo unrooted binary trees T1">T1T1 and T2">T2T2 having..