OPTIMAL ALGORITHM FOR FINDING DNA MOTIFS WITH NUCLEOTIDE ADJACENT DEPENDENCY∗ FRANCIS Y.L. CHIN HENRY C.M. LEUNG

First Page		Document Content
Date: 2008-02-18 04:02:24 Protein domains Gene expression Transcription factors Sequence motif DNA binding site Zinc finger Nucleic acid sequence Short linear motif Suffix tree Biology Bioinformatics DNA		OPTIMAL ALGORITHM FOR FINDING DNA MOTIFS WITH NUCLEOTIDE ADJACENT DEPENDENCY∗ FRANCIS Y.L. CHIN HENRY C.M. LEUNG Add to Reading List Source URL: i.cs.hku.hk Download Document from Source Website File Size: 299,33 KB Share Document on Facebook

	Predicting Protein-Protein Interactions with Collaborative Filtering Algorithms István Albert Collaborative Filtering (CF) has proven to be a valuable tool for predicting relevant items in many different domains from e- DocID: 1vfr6 - View Document
	Exercise – Ensembl Fungi: export sequences in FASTA format Retrieve the fasta sequences of all genes in Schistosoma mansoni located on chromosome 5 that are protein coding and contain transmembrane domains only. Do a DocID: 1vbN9 - View Document
	Pathway Logic Pathway Logic Modeling of Protein Functional Domains in Signal Transduction DocID: 1uZZY - View Document
	Exercise 1 – Export sequences in FASTA format Retrieve the fasta sequences of all wheat genes that have an EntrezGene ID, that are protein coding and signal peptide domains. Do a count after selection of each filter t DocID: 1uLeX - View Document
	Evolution of a Computer Program for Classifying Protein Segments as Transmembrane Domains Using Genetic Programming John R. Koza Computer Science Department Stanford University Stanford, CAUSA DocID: 1uexi - View Document