Results 1 - 10 of 17,023

MAFFT version 5: improvement in accuracy of multiple sequence alignment

by Kazutaka Katoh, Kei-ichi Kuma, Hiroyuki Toh, Takashi Miyata - NUCLEIC ACIDS RES , 2005
"... The accuracy of multiple sequence alignment pro-gram MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, 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 high ..."
Abstract - Cited by 801 (5 self) - Add to MetaCart
The accuracy of multiple sequence alignment pro-gram MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, 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

SPEA2: Improving the Strength Pareto Evolutionary Algorithm

by Eckart Zitzler, Marco Laumanns, Lothar Thiele , 2001
"... The Strength Pareto Evolutionary Algorithm (SPEA) (Zitzler and Thiele 1999) is a relatively recent technique for finding or approximating the Pareto-optimal set for multiobjective optimization problems. In different studies (Zitzler and Thiele 1999; Zitzler, Deb, and Thiele 2000) SPEA has shown very ..."
Abstract - Cited by 708 (19 self) - Add to MetaCart
, and Zamboglou 2001). In this paper, an improved version, namely SPEA2, is proposed, which incorporates in contrast to its predecessor a fine-grained fitness assignment strategy, a density estimation technique, and an enhanced archive truncation method. The comparison of SPEA2 with SPEA and two other modern

The SimpleScalar tool set, version 2.0

by Doug Burger, Todd M. Austin - Computer Architecture News , 1997
"... This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and high-performance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces, bette ..."
Abstract - Cited by 1844 (43 self) - Add to MetaCart
, better documentation, easier installation, improved portability, and higher performance. This report contains a complete description of the tool set, including retrieval and installation instructions, a description of how to use the tools, a description of the target SimpleScalar architecture, and many

Network Time Protocol (Version 3) Specification, Implementation and Analysis

by David L. Mills , 1992
"... Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings are not ava ..."
Abstract - Cited by 520 (18 self) - Add to MetaCart
local routing algorithms and time daemons. Status of this Memo This RFC specifies an IAB standards track protocol for the Internet community and requests discussion and suggestions for improvements. Please refer to the current edition of the <169>IAB Official Protocol Standards<170>

Depth first search and linear graph algorithms

by Robert Tarjan - SIAM JOURNAL ON COMPUTING , 1972
"... The value of depth-first search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract - Cited by 1406 (19 self) - Add to MetaCart
The value of depth-first search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components

Improved prediction of signal peptides -- SignalP 3.0

by Jannick Dyrløv Bendtsen, Henrik Nielsen, Gunnar von Heijne, Søren Brunak - J. MOL. BIOL. , 2004
"... We describe improvements of the currently most popular method for prediction of classically secreted proteins, SignalP. SignalP consists of two different predictors based on neural network and hidden Markov model algorithms, where both components have been updated. Motivated by the idea that the cle ..."
Abstract - Cited by 654 (7 self) - Add to MetaCart
We describe improvements of the currently most popular method for prediction of classically secreted proteins, SignalP. SignalP consists of two different predictors based on neural network and hidden Markov model algorithms, where both components have been updated. Motivated by the idea

Web Server Workload Characterization: The Search for Invariants (Extended Version)

by Martin F. Arlitt, Carey L. Williamson , 1996
"... The phenomenal growth in popularity of the World Wide Web (WWW, or the Web) has made WWW traffic the largest contributor to packet and byte traffic on the NSFNET backbone. This growth has triggered recent research aimed at reducing the volume of network traffic produced by Web clients and servers, b ..."
Abstract - Cited by 471 (6 self) - Add to MetaCart
, by using caching, and reducing the latency for WWW users, by using improved protocols for Web interaction. Fundamental to the goal of improving WWW performance is an understanding of WWW workloads. This paper presents a workload characterization study for Internet Web servers. Six different data sets

An Improved Version of Volume Dominance for

by Multi-objective Optimisation, Khoi Le, Dario L, Hui Li
"... Abstract. This paper proposes an improved version of volume domi-nance to assign fitness to solutions in Pareto-based multi-objective optimisation. The impact of this revised volume dominance on the per-formance of multi-objective evolutionary algorithms is investigated by incorporating it into thre ..."
Abstract - Add to MetaCart
Abstract. This paper proposes an improved version of volume domi-nance to assign fitness to solutions in Pareto-based multi-objective optimisation. The impact of this revised volume dominance on the per-formance of multi-objective evolutionary algorithms is investigated by incorporating

Bagging predictors

by LEO BREIMAN , 1996
"... Bagging predictors is a method for generating multiple versions of a predictor and using these to get an aggregated predictor. The aggregation averages over the versions when predicting a numerical outcome and does a plurality vote when predicting a class. The multiple versions are formed by making ..."
Abstract - Cited by 3650 (1 self) - Add to MetaCart
Bagging predictors is a method for generating multiple versions of a predictor and using these to get an aggregated predictor. The aggregation averages over the versions when predicting a numerical outcome and does a plurality vote when predicting a class. The multiple versions are formed

The Pfam protein families database

by Alex Bateman, Lachlan Coin, Richard Durbin, Robert D. Finn, Volker Hollich, Ajay Khanna, Mhairi Marshall, Simon Moxon, Erik L. L. Sonnhammer, David J. Studholme, Corin Yeats, Sean R. Eddy - Nucleic Acids Res , 2002
"... Pfam is a large collection of protein families and domains. Over the past 2 years the number of families in Pfam has doubled and now stands at 6190 (version 10.0). Methodology improvements for searching the Pfam collection locally as well as via the web are described. Other recent innovations includ ..."
Abstract - Cited by 1070 (39 self) - Add to MetaCart
Pfam is a large collection of protein families and domains. Over the past 2 years the number of families in Pfam has doubled and now stands at 6190 (version 10.0). Methodology improvements for searching the Pfam collection locally as well as via the web are described. Other recent innovations
Results 1 - 10 of 17,023