نتایج جستجو برای: sequence comparison

تعداد نتایج: 986015  

Journal: :international journal of horticultural science and technology 2015
mohsen ashrfai mohammad farsi amin mirshamsi mozhgan parvandi

many recent studies have shown that glycosylation patterns of agaricus bisporus are similar to those of mammalians, so that this organism is a good candidate for the expression of glycosylated pharmaceutical protein. to achieve constant interested gene expression in all cells of the organism, proper promoter isolation is necessary. to isolate this promoter, pcr with specific primers was perform...

The genomic and cDNA clones encoding cellobiohydrolase II (CBHII) have been isolated and sequenced from a native Iranian isolate of Trichoderma parceramosum, a high cellulolytic enzymes producer isolate. This represents the first report of cbhII gene from this organism. Comparison of genomic and cDNA sequences indicates this gene contains three short introns and also an open reading frame codin...

Journal: :Advances in experimental medicine and biology 2011
Ankit Agrawal Alok Choudhary Xiaoqiu Huang

There has been a deluge of biological sequence data in the public domain, which makes sequence comparison one of the most fundamental computational problems in bioinformatics. The biologists routinely use pairwise alignment programs to identify similar, or more specifically, related sequences (having common ancestor). It is a well-known fact that almost everything in bioinformatics depends on t...

2001
Abdullah N. Arslan

The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach was designed to reveal the highly conserved fragments by discarding poorly conserved initial and terminal segments. However, the existing notion of local similarity has a serious aw: it does not discard poorly conserved...

Journal: :Nucleic Acids Research 2006
Walter Pirovano K. Anton Feenstra Jaap Heringa

Multiple sequence alignments are often used to reveal functionally important residues within a protein family. They can be particularly useful for the identification of key residues that determine functional differences between protein subfamilies. We present a new entropy-based method, Sequence Harmony (SH) that accurately detects subfamily-specific positions from a multiple sequence alignment...

2006
Walter Pirovano K. Anton Feenstra Jaap Heringa

Multiple sequence alignments are often used to reveal functionally important residues within a protein family. They can be particularly useful for the identification of key residues that determine functional differences between protein subfamilies. We present a new entropybased method, Sequence Harmony (SH) that accurately detects subfamily specific positions from a multiple sequence alignment....

Journal: :Proceedings. IEEE Computer Society Bioinformatics Conference 2002
Lorie Dudoignon Eric Glémet Hendrik Cornelis Heus Mathieu Raffinot

We present a fast algorithm for sequence clustering and searching which works with large sequence databases. It uses a strictly defined similarity measure. The algorithm is faster than conventional EST clustering approaches because its complexity is directly related to the number of subwords shared by the sequences. Furthermore, the algorithm also works with proteic sequences and large sequence...

2017
Rohit Prabhavalkar Kanishka Rao Tara N. Sainath Bo Li Leif Johnson Navdeep Jaitly

In this work, we conduct a detailed evaluation of various allneural, end-to-end trained, sequence-to-sequence models applied to the task of speech recognition. Notably, each of these systems directly predicts graphemes in the written domain, without using an external pronunciation lexicon, or a separate language model. We examine several sequence-to-sequence models including connectionist tempo...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید