TITLE

Identification and Characterization of the Rat DVL2 Gene Using Bioinformatic Tools

AUTHOR(S)
Varişli, Lokman; Çen, Osman
PUB. DATE
June 2007
SOURCE
Turkish Journal of Biology;2007, Vol. 31 Issue 2, p81
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
We identified and characterized the rat DVL2 gene using bioinformatics. In addition to the structure and chromosomal localization of the rat DVL2 gene, the transcribed and translated protein product of the gene was analyzed in silico. Results showed that the rat DVL2 gene consists of 15 exons and is located on the rat genomic contig WGA1854.3 on chromosome 10. Database searches using the rat DVL2 amino acid sequence as a query showed a number of homologous protein sequences in different species, including M. musculus, P. troglodytes, C. familiaris, H. sapiens, B. taurus, D. rerio, X. laevis, and T. nigroviridis. DAX, PDZ signaling, and DEP-conserved domain structures were identified within the rat DVL2 protein.
ACCESSION #
25977855

 

Related Articles

  • NNAlign: A Web-Based Prediction Method Allowing Non-Expert End-User Discovery of Sequence Motifs in Quantitative Peptide Data. Andreatta, Massimo; Schafer-Nielsen, Claus; Lund, Ole; Buus, Søren; Nielsen, Morten // PLoS ONE;2011, Vol. 6 Issue 11, p1 

    Recent advances in high-throughput technologies have made it possible to generate both gene and protein sequence data at an unprecedented rate and scale thereby enabling entirely new ''omics''-based approaches towards the analysis of complex biological processes. However, the amount and...

  • Advances and Pitfalls in Protein Structure Prediction. Cozzetto, D.; Tramontano, A. // Current Protein & Peptide Science;Dec2008, Vol. 9 Issue 6, p567 

    Three dimensional protein structures are crucial for understanding biology at both molecular and system level. Despite the advances in experimental structural biology, the pace of sequence deposition into databanks considerably exceeds that of structure determination. Inevitably the functional...

  • Aligning Sequences by Minimum Description Length. Conery, John S. // EURASIP Journal on Bioinformatics & Systems Biology;2007, p1 

    This paper presents a new information theoretic framework for aligning sequences in bioinformatics. A transmitter compresses a set of sequences by constructing a regular expression that describes the regions of similarity in the sequences. To retrieve the original set of sequences, a receiver...

  • ProLoc-GO: Utilizing informative Gene Ontology terms for sequence-based prediction of protein subcellular localization. Wen-Lin Huang; Chun-Wei Tung; Shih-Wen Ho; Shiow-Fen Hwang; Shinn-Ying Ho // BMC Bioinformatics;2008, Vol. 9, Special section p1 

    Background: Gene Ontology (GO) annotation, which describes the function of genes and gene products across species, has recently been used to predict protein subcellular and subnuclear localization. Existing GO-based prediction methods for protein subcellular localization use the known accession...

  • Ortholog identification in the presence of domain architecture rearrangement. Sjölander, Kimmen; Datta, Ruchira S.; Shen, Yaoqing; Shoffner, Grant M. // Briefings in Bioinformatics;Sep2011, Vol. 12 Issue 5, p413 

    Ortholog identification is used in gene functional annotation, species phylogeny estimation, phylogenetic profile construction and many other analyses. Bioinformatics methods for ortholog identification are commonly based on pairwise protein sequence comparisons between whole genomes....

  • Classification of protein sequences by means of irredundant patterns. Comin, Matteo; Verzotto, Davide // BMC Bioinformatics;2010 Supplement 1, Vol. 11, Special section p1 

    Background: The classification of protein sequences using string algorithms provides valuable insights for protein function prediction. Several methods, based on a variety of different patterns, have been previously proposed. Almost all string-based approaches discover patterns that are not...

  • Efficient algorithms for accurate hierarchical clustering of huge datasets: tackling the entire protein space. Yaniv Loewenstein; Elon Portugaly; Menachem Fromer; Michal Linial // Bioinformatics;Jul2008, Vol. 24 Issue 13, pi41 

    Motivation: UPGMA (average linking) is probably the most popular algorithm for hierarchical data clustering, especially in computational biology. However, UPGMA requires the entire dissimilarity matrix in memory. Due to this prohibitive requirement, UPGMA is not scalable to very large datasets....

  • DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment. Subramanian, Amarendran R.; Weyer-Menkhoff, Jan; l Kaufmann, Michae; Morgenstern, Burkhard // BMC Bioinformatics;2005, Vol. 6, p66 

    Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous version 2.2 of DIALIGN. This previous version is superior to Needleman-Wunsch-based multi-alignment programs on locally...

  • Comparative mapping of sequence-based and structure-based protein domains. Ya Zhang; Chandonia, John-Marc; Chris6 Ding; Holbrook, Stephen R. // BMC Bioinformatics;2005, Vol. 6, p77 

    Background: Protein domains have long been an ill-defined concept in biology. They are generally described as autonomous folding units with evolutionary and functional independence. Both structure-based and sequence-based domain definitions have been widely used. But whether these types of...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics