Open Access. Powered by Scholars. Published by Universities.®

Life Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Life Sciences

Analyzing In Situ Gene Expression In The Mouse Brain With Image Registration, Feature Extraction And Block Clustering, Manjunatha Jagalur, Chris Pal, Erik G. Learned-Miller, R R Thomas Zoeller, David Kulp Dec 2007

Analyzing In Situ Gene Expression In The Mouse Brain With Image Registration, Feature Extraction And Block Clustering, Manjunatha Jagalur, Chris Pal, Erik G. Learned-Miller, R R Thomas Zoeller, David Kulp

Erik G Learned-Miller

Background: Many important high throughput projects use in situ hybridization and may require the analysis of images of spatial cross sections of organisms taken with cellular level resolution. Projects creating gene expression atlases at unprecedented scales for the embryonic fruit fly as well as the embryonic and adult mouse already involve the analysis of hundreds of thousands of high resolution experimental images mapping mRNA expression patterns. Challenges include accurate registration of highly deformed tissues, associating cells with known anatomical regions, and identifying groups of genes whose expression is coordinately regulated with respect to both concentration and spatial location. Solutions to …


Identification Of Synechococcus Sp. Iu 625 Metallothionein Gene And Its Evolutionary Relationship To The Metallothionein Gene Of Other Cyanobacteria, Tin-Chun Chu, Lee Lee, John Gaynor, Quinn Vega, Bonnie Lustigman, Shankar Srinivasan Jun 2007

Identification Of Synechococcus Sp. Iu 625 Metallothionein Gene And Its Evolutionary Relationship To The Metallothionein Gene Of Other Cyanobacteria, Tin-Chun Chu, Lee Lee, John Gaynor, Quinn Vega, Bonnie Lustigman, Shankar Srinivasan

Tin-Chun Chu, Ph.D.

No abstract provided.


Chess, Chance And Conspiracy, Mark Segal Dec 2006

Chess, Chance And Conspiracy, Mark Segal

Mark R Segal

Chess and chance are seemingly strange bedfellows. Luck and/or randomness have no apparent role in move selection when the game is played at the highest levels. However, when competition is at the ultimate level, that of the World Chess Championship (WCC), chess and conspiracy are not strange bedfellows, there being a long and colorful history of accusations levied between participants. One such accusation, frequently repeated, was that all the games in the 1985 WCC (Karpov vs Kasparov) were fixed and prearranged move by move. That this claim was advanced by a former World Champion, Bobby Fischer, argues that it ought …


Does Direct Optimization Produce More Accurate Alignments And Topologies? Poy Vs. Clustalw+Paup*, T. Heath Ogden Dec 2006

Does Direct Optimization Produce More Accurate Alignments And Topologies? Poy Vs. Clustalw+Paup*, T. Heath Ogden

T. Heath Ogden

Direct optimization frameworks for simultaneously estimating alignments and phylogenies have recently been developed. One such method, implemented in the program POY, is becoming more common for analyses of variable length sequences (e.g., analyses using ribosomal genes) and for combined evidence analyses (morphology + multiple genes). Simulation of sequences containing insertion and deletion events was performed in order to directly compare a widely used method of multiple sequence alignment (ClustalW) and subsequent parsimony analysis in PAUP* with direct optimization via POY. Data sets were simulated for pectinate, balanced, and random tree shapes under different conditions (clocklike, non-clocklike, and ultrametric). Alignment accuracy …


How Should Gaps Be Treated In Parsimony? A Comparison Of Approaches Using Simulation, T. Heath Ogden Dec 2006

How Should Gaps Be Treated In Parsimony? A Comparison Of Approaches Using Simulation, T. Heath Ogden

T. Heath Ogden

Simulation with indels was used to produce alignments where true site homologies in DNA sequences were known; the gaps from these datasets were removed and the sequences were then aligned to produce hypothesized alignments. Both alignments were then analyzed under three widely used methods of treating gaps during tree reconstruction under the maximum parsimony principle. With the true alignments, for many cases (82%), there was no diVerence in topological accuracy for the diVerent methods of gap coding. However, in cases where a diVerence was present, coding gaps as a Wfth state character or as separate presence/absence characters outperformed treating gaps …


Finding Molecular Complexes Through Multiple Layer Clustering Of Protein Interaction Networks, Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaogang Wang Dec 2006

Finding Molecular Complexes Through Multiple Layer Clustering Of Protein Interaction Networks, Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaogang Wang

William B. Andreopoulos

Clustering protein-protein interaction networks (PINs) helps to identify complexes that guide the cell machinery. Clustering algorithms often create a flat clustering, without considering the layered structure of PINs. We propose the MULIC clustering algorithm that produces layered clusters. We applied MULIC to five PINs. Clusters correlate with known MIPS protein complexes. For example, a cluster of 79 proteins overlaps with a known complex of 88 proteins. Proteins in top cluster layers tend to be more representative of complexes than proteins in bottom layers. Lab work on finding unknown complexes or determining drug effects can be guided by top layer proteins.