نتایج جستجو برای: homology search

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

Journal: :Journal of computational biology : a journal of computational molecular cell biology 1998
William Noble Grundy

The function of an unknown biological sequence can often be accurately inferred by identifying sequences homologous to the original sequence. Given a query set of known homologs, there exist at least three general classes of techniques for finding additional homologs: pairwise sequence comparisons, motif analysis, and hidden Markov modeling. Pairwise sequence comparisons are typically employed ...

2004
Abhijit Chattaraj Hugh E. Williams

Fast, accurate, and scalable search techniques for homology searching of large genomic collections are becoming an increasingly important requirement large genomic collections are becoming an increasingly important requirement as genomic sequence collections continue to double in size almost yearly. Almost all homology search techniques rely on extracting fixed-length overlapping sequences from...

Journal: :Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing 2001
Jeffrey T. Chang Soumya Raychaudhuri Russ B. Altman

Annotating the tremendous amount of sequence information being generated requires accurate automated methods for recognizing homology. Although sequence similarity is only one of many indicators of evolutionary homology, it is often the only one used. Here we find that supplementing sequence similarity with information from biomedical literature is successful in increasing the accuracy of homol...

2005
Abhijit Chattaraj Hugh E. Williams Adam Cannane

Homology search is an important step in discovering evolutionary relationships in modern molecular biology. In particular, it is key to analysing data from large-scale sequencing initiatives: by establishing homology between a newly-discovered sequence and well-understood sequences in curated repositories, it is possible to infer structure and function without the need for costly, time-consumin...

2011
Diana L. Kolbe Sean R. Eddy

MOTIVATION Homology search for RNAs can use secondary structure information to increase power by modeling base pairs, as in covariance models, but the resulting computational costs are high. Typical acceleration strategies rely on at least one filtering stage using sequence-only search. RESULTS Here we present the multi-segment CYK (MSCYK) filter, which implements a heuristic of ungapped stru...

Journal: :Genome research 2007
Eva K Freyhult Jonathan P Bollback Paul P Gardner

Homology search is one of the most ubiquitous bioinformatic tasks, yet it is unknown how effective the currently available tools are for identifying noncoding RNAs (ncRNAs). In this work, we use reliable ncRNA data sets to assess the effectiveness of methods such as BLAST, FASTA, HMMer, and Infernal. Surprisingly, the most popular homology search methods are often the least accurate. As a resul...

Journal: :Bioinformatics 2002
Bin Ma John Tromp Ming Li

MOTIVATION Genomics and proteomics studies routinely depend on homology searches based on the strategy of finding short seed matches which are then extended. The exploding genomic data growth presents a dilemma for DNA homology search techniques: increasing seed size decreases sensitivity whereas decreasing seed size slows down computation. RESULTS We present a new homology search algorithm '...

2013
Travis J. Wheeler Sean R. Eddy

SUMMARY Sequence database searches are an essential part of molecular biology, providing information about the function and evolutionary history of proteins, RNA molecules and DNA sequence elements. We present a tool for DNA/DNA sequence comparison that is built on the HMMER framework, which applies probabilistic inference methods based on hidden Markov models to the problem of homology search....

2007
Xuefeng Cui Tomáš Vinař Broňa Brejová Dennis Shasha Ming Li

Motivation: Life science researchers often require an exhaustive list of protein coding genes similar to a given query gene. To find such genes, homology search tools, such as BLAST or PatternHunter, return a set of high-scoring pairs (HSPs). These HSPs then need to be correlated with existing sequence annotations, or assembled manually into putative gene structures. This process is error-prone...

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

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