|
|
Main.SkillSet History
Hide minor edits - Show changes to markup
October 29, 2011, at 10:51 PM
by 76.123.118.17 -
Changed lines 2-3 from:
In general, abstraction is a process to conceptualize real-world observations (such as biological phenomenon) into generic models (symbolic models). For computational analysis, the abstract models is also the starting point.
to:
In general, abstraction is a process to conceptualize real-world observations (such as biological phenomenon) into generic models (symbolic models). For computational analysis, the abstract models is also the starting point.
October 29, 2011, at 10:50 PM
by 76.123.118.17 -
Changed lines 18-19 from:
to:
October 29, 2011, at 10:49 PM
by 76.123.118.17 -
Added line 13:
Added line 15:
Added line 17:
October 29, 2011, at 10:49 PM
by 76.123.118.17 -
Changed lines 12-14 from:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment. NCBI BLAST is a fast program because it only searches in selected regions in the search space. With properly designed methods, we can greatly reduce the number of steps needs to find a solution in a search space.
to:
Search space is a fundamental concept in quantitative reasoning. Google made its name by efficiently narrowing down the internet searching space.
In bioinformatics, search space is illustrated in dot plot and dynamic programming approach for sequence alignment. NCBI BLAST is a fast program because it only searches in selected regions in the search space. With properly designed methods, we can greatly reduce the number of steps needs to find a solution in a search space.
In biology, it is also a wonder how the very few copies of transcription factors can effectively find its binding motifs along chromosomes.
October 29, 2011, at 10:46 PM
by 76.123.118.17 -
Changed line 2 from:
Abstraction is a process to convert biological questions into symbolic models that can be addressed quantitatively.
to:
In general, abstraction is a process to conceptualize real-world observations (such as biological phenomenon) into generic models (symbolic models). For computational analysis, the abstract models is also the starting point.
Changed lines 6-7 from:
to:
Pipeline analysis in genome analysis is an example of this.
October 29, 2011, at 10:42 PM
by 76.123.118.17 -
Changed lines 5-10 from:
Be able to visualize quantitative results and interpret them.
Phylogenetic trees is probably a classical example.
to:
Deleted lines 9-14:
Permutation are often used to evaluate the significance of biological observations.
Break down of a large problem into manageable ones. ClustalW use pairwise-approach to progressively build a multiple alignment, guided by a tree that describes the combination of pairs at each step.
Changed lines 14-26 from:
to:
Be able to visualize quantitative results and interpret them.
Phylogenetic trees is probably a classical example.
Permutation are often used to evaluate the significance of biological observations.
Break down of a large problem into manageable ones. ClustalW use pairwise-approach to progressively build a multiple alignment, guided by a tree that describes the combination of pairs at each step.
September 18, 2011, at 01:37 PM
by 24.126.190.229 -
Changed line 48 from:
475 visits since 2011, September 18.
to:
September 18, 2011, at 01:36 PM
by 24.126.190.229 -
Added lines 47-48:
475 visits since 2011, September 18.
August 11, 2011, at 05:56 AM
by 24.126.190.229 -
Changed line 5 from:
to:
August 11, 2011, at 05:56 AM
by 24.126.190.229 -
Added lines 5-7:
Be able to visualize quantitative results and interpret them.
Added line 24:
December 02, 2010, at 05:05 PM
by 149.175.45.99 -
Added line 2:
Abstraction is a process to convert biological questions into symbolic models that can be addressed quantitatively.
Changed lines 22-23 from:
Phylogeny is the basic concept in biology.
to:
Phylogeny is the basic concept in biology.
Added line 26:
December 02, 2010, at 05:03 PM
by 149.175.45.99 -
Added lines 20-22:
- Tree thinking (Phylogeny)
Phylogeny is the basic concept in biology.
December 02, 2010, at 05:01 PM
by 149.175.45.99 -
Changed lines 2-3 from:
Newick representation of trees is an abstractiion of the graphs.
to:
Newick representation of trees is an abstraction of the graphs.
Changed lines 13-16 from:
To compare samples generated by different experiments, we need to put them on the same ground. This is why microarray data and sequence profiles need to be normalized.
to:
Added lines 16-19:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment. NCBI BLAST is a fast program because it only searches in selected regions in the search space. With properly designed methods, we can greatly reduce the number of steps needs to find a solution in a search space.
Changed lines 22-23 from:
to:
To compare samples generated by different experiments, we need to put them on the same ground. This is why microarray data and sequence profiles need to be normalized.
Deleted lines 28-31:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment. NCBI BLAST is a fast program because it only searches in selected regions in the search space. With properly designed methods, we can greatly reduce the number of steps needs to find a solution in a search space.
February 19, 2009, at 01:06 PM
by 75.143.68.139 -
Changed lines 27-28 from:
to:
February 19, 2009, at 01:05 PM
by 75.143.68.139 -
Changed lines 26-27 from:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment. NCBI BLAST is a fast program because it only searches in selected regions in the search space.
to:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment. NCBI BLAST is a fast program because it only searches in selected regions in the search space. With properly designed methods, we can greatly reduce the number of steps needs to find a solution in a search space.
November 11, 2008, at 09:48 AM
by 192.203.127.3 -
Changed lines 11-12 from:
to:
Permutation are often used to evaluate the significance of biological observations.
Changed lines 32-33 from:
to:
Gene/protein interaction networks
November 11, 2008, at 09:46 AM
by 192.203.127.3 -
Changed lines 2-3 from:
Newick representation of tree is an abstractiion of the graphs.
to:
Newick representation of trees is an abstractiion of the graphs.
Changed lines 5-6 from:
Array, list, stack, queue, graph
to:
Phylogenetic trees is probably a classical example.
November 11, 2008, at 09:45 AM
by 192.203.127.3 -
Changed lines 2-3 from:
to:
Newick representation of tree is an abstractiion of the graphs.
October 16, 2008, at 04:04 PM
by 192.203.127.3 -
Changed lines 6-8 from:
PCR is one of the best example of "iteration" application in biology, though somewhat unknowingly.
to:
PCR is one of the best example of "recursion" application in biology, though somewhat unknowingly.
October 07, 2008, at 10:01 AM
by 192.203.127.3 -
Changed lines 12-13 from:
To compare samples generated by different experiments, we need to put them on the same ground. This is why microarray data need to be normalized before they are compared.
to:
To compare samples generated by different experiments, we need to put them on the same ground. This is why microarray data and sequence profiles need to be normalized.
September 25, 2008, at 03:44 PM
by 192.203.127.3 -
Changed lines 12-13 from:
To compare samples generated by different experiments, we need to put them on the same grounds. This is why microarray data need to be normalized before they are compared.
to:
To compare samples generated by different experiments, we need to put them on the same ground. This is why microarray data need to be normalized before they are compared.
September 25, 2008, at 03:44 PM
by 192.203.127.3 -
Added lines 11-13:
To compare samples generated by different experiments, we need to put them on the same grounds. This is why microarray data need to be normalized before they are compared.
September 25, 2008, at 12:56 PM
by 192.203.127.3 -
Changed lines 29-30 from:
to:
In the Smith-Waterman algorithm for pairwise sequence alignment, the best direction is chosen at each step from 3 possible directions. The high-score-segment is constructed by going backward along the marked directions.
September 25, 2008, at 12:52 PM
by 192.203.127.3 -
Changed lines 12-13 from:
Break down of a large problem into manageable ones.
to:
Break down of a large problem into manageable ones. ClustalW use pairwise-approach to progressively build a multiple alignment, guided by a tree that describes the combination of pairs at each step.
September 25, 2008, at 12:50 PM
by 192.203.127.3 -
Changed lines 24-25 from:
to:
ClustalW is a greedy method for multiple sequence alignment because it looks for the best pairs (local optimal solutions) in each step.
September 25, 2008, at 12:49 PM
by 192.203.127.3 -
Changed lines 12-13 from:
Break down of a large problem into manageable ones.
to:
Break down of a large problem into manageable ones.
September 25, 2008, at 12:49 PM
by 192.203.127.3 -
Changed lines 3-4 from:
- Data structures, array, list, stack, queue, graph
to:
Array, list, stack, queue, graph
September 25, 2008, at 12:49 PM
by 192.203.127.3 -
Added lines 3-4:
- Data structures, array, list, stack, queue, graph
September 16, 2008, at 04:31 PM
by 192.203.127.3 -
Changed lines 1-3 from:
to:
Changed lines 6-8 from:
- Permutation
- Decomposition
to:
- Permutation
- Decomposition
Changed lines 11-17 from:
- Modularization
- Optimization
- Computational complexity
- Search space
to:
- Modularization
- Optimization
- Computational complexity
- Search space
Changed lines 20-26 from:
- Greedy method
- Graphs and networks
- Trace back
to:
- Greedy method
- Graphs and networks
- Trace back
September 16, 2008, at 04:30 PM
by 192.203.127.3 -
Changed lines 9-10 from:
to:
Break down of a large problem into manageable ones.
Changed lines 24-25 from:
to:
September 15, 2008, at 10:52 PM
by 75.143.68.139 -
Changed lines 17-18 from:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment. NCBI BLAST is a fast algorithm because it only searches in selected regions in the search space.
to:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment. NCBI BLAST is a fast program because it only searches in selected regions in the search space.
September 15, 2008, at 10:51 PM
by 75.143.68.139 -
Changed lines 17-18 from:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment.
to:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment. NCBI BLAST is a fast algorithm because it only searches in selected regions in the search space.
September 10, 2008, at 10:36 PM
by 75.143.68.139 -
Changed lines 21-24 from:
to:
September 10, 2008, at 10:36 PM
by 75.143.68.139 -
Added lines 14-15:
Deleted lines 16-19:
- Computational complexity
- Search space
September 08, 2008, at 10:08 PM
by 75.143.68.139 -
Added line 20:
September 08, 2008, at 10:08 PM
by 75.143.68.139 -
Changed lines 4-5 from:
PCR is one of the best example of "iteration" application in biology, though somewhat unknowingly.
to:
PCR is one of the best example of "iteration" application in biology, though somewhat unknowingly.
Changed line 19 from:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment.
to:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment.
September 08, 2008, at 10:08 PM
by 75.143.68.139 -
Changed line 19 from:
to:
Search space is illustrated in dot plot and dynamic programming approach for sequence alignment.
September 08, 2008, at 11:53 AM
by 192.203.127.3 -
Changed lines 19-20 from:
to:
September 08, 2008, at 11:53 AM
by 192.203.127.3 -
Added lines 18-20:
September 01, 2008, at 11:17 PM
by 75.143.68.139 -
Changed lines 20-21 from:
to:
September 01, 2008, at 11:16 PM
by 75.143.68.139 -
Changed lines 10-21 from:
to:
- Modularization
- Optimization
- Search space
- Computational complexity
- Greedy method
August 28, 2008, at 01:04 PM
by 192.203.127.3 -
Deleted line 0:
Changed lines 4-5 from:
PCR is one of the best example of "iteration" application in biology.
to:
PCR is one of the best example of "iteration" application in biology, though somewhat unknowingly.
August 28, 2008, at 01:04 PM
by 192.203.127.3 -
Changed lines 1-8 from:
Abstraction
Iteration
Permutation
Decomposition
to:
PCR is one of the best example of "iteration" application in biology.
- Permutation
- Decomposition
April 29, 2008, at 01:43 PM
by 192.203.127.3 -
Added lines 1-8:
Abstraction
Iteration
Permutation
Decomposition
|
|