Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
610,439
Multiple sequence alignment with the Clustal series of programs
- Nucleic Acids Res
, 2003
"... The Clustal series of programs are widely used in molecular biology for the multiple alignment of both nucleic acid and protein sequences and for preparing phylogenetic trees. The popularity of the programs depends on a number of factors, including not only the accuracy of the results, but also the ..."
Abstract
-
Cited by 725 (5 self)
- Add to MetaCart
The Clustal series of programs are widely used in molecular biology for the multiple alignment of both nucleic acid and protein sequences and for preparing phylogenetic trees. The popularity of the programs depends on a number of factors, including not only the accuracy of the results, but also
2005 MAFFT version 5: improvement in accuracy of multiple sequence alignment. Nucleic Acids Res
"... The accuracy of multiple sequence alignment pro-gram MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement opti-ons, H-INS-i, F-INS-i and G-INS-i, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed hig ..."
Abstract
-
Cited by 788 (5 self)
- Add to MetaCart
the effect of the number of homologues included in an alignment. For a multiple alignment consisting of 8 sequences with low similarity, the accuracy was improved (2–10 percentage points) when the sequences were aligned together with dozens of their close homologues (E-value, 105–1020) col-lected from a
A greedy algorithm for aligning DNA sequences
- J. COMPUT. BIOL
, 2000
"... For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy a ..."
Abstract
-
Cited by 576 (16 self)
- Add to MetaCart
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy
Wrapper Induction for Information Extraction
, 1997
"... The Internet presents numerous sources of useful information---telephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources are usually ..."
Abstract
-
Cited by 612 (30 self)
- Add to MetaCart
The Internet presents numerous sources of useful information---telephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources
A Systematic Comparison of Various Statistical Alignment Models
- COMPUTATIONAL LINGUISTICS
, 2003
"... ..."
Automatic Word Sense Discrimination
- Journal of Computational Linguistics
, 1998
"... This paper presents context-group discrimination, a disambiguation algorithm based on clustering. Senses are interpreted as groups (or clusters) of similar contexts of the ambiguous word. Words, contexts, and senses are represented in Word Space, a high-dimensional, real-valued space in which closen ..."
Abstract
-
Cited by 530 (1 self)
- Add to MetaCart
is automatic and unsupervised in both training and application: senses are induced from a corpus without labeled training insta,nces or other external knowledge sources. The paper demonstrates good performance of context-group discrimination for a sample of natural and artificial ambiguous words
PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment
, 2000
"... Researchers in the ontology-design field have developed the content for ontologies in many domain areas. Recently, ontologies have become increasingly common on the WorldWide Web where they provide semantics for annotations in Web pages. This distributed nature of ontology development has led t ..."
Abstract
-
Cited by 495 (12 self)
- Add to MetaCart
of the sharing process. We have developed and implemented PROMPT, an algorithm that provides a semi-automatic approach to ontology merging and alignment. PROMPT performs some tasks automatically and guides the user in performing other tasks for which his intervention is required.
Controlled and automatic human information processing
- I. Detection, search, and attention. Psychological Review
, 1977
"... A two-process theory of human information processing is proposed and applied to detection, search, and attention phenomena. Automatic processing is activa-tion of a learned sequence of elements in long-term memory that is initiated by appropriate inputs and then proceeds automatically—without subjec ..."
Abstract
-
Cited by 841 (15 self)
- Add to MetaCart
A two-process theory of human information processing is proposed and applied to detection, search, and attention phenomena. Automatic processing is activa-tion of a learned sequence of elements in long-term memory that is initiated by appropriate inputs and then proceeds automatically
Twilight Zone of Protein Sequence Alignments
, 1999
"... l findings are applicable to automatic database searches. Keywords: alignment quality analysis/evolutionary conservation/ genome analysis/protein sequence alignment/sequence space hopping Introduction Protein sequence alignments in twilight zone Protein sequences fold into unique three-dimension ..."
Abstract
-
Cited by 387 (48 self)
- Add to MetaCart
l findings are applicable to automatic database searches. Keywords: alignment quality analysis/evolutionary conservation/ genome analysis/protein sequence alignment/sequence space hopping Introduction Protein sequence alignments in twilight zone Protein sequences fold into unique three
Results 1 - 10
of
610,439
