๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Survey on index based homology search algorithms

โœ Scribed by Xianyang Jiang; Peiheng Zhang; Xinchun Liu; Stephen S.-T. Yau

Book ID
106539286
Publisher
Springer US
Year
2007
Tongue
English
Weight
407 KB
Volume
40
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast nearest-neighbor search algorithms
Fast nearest-neighbor search algorithms based on approximation-elimination search
โœ V. Ramasubramanian; Kuldip K. Paliwal ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 272 KB

In this paper, we provide an overview of fast nearest-neighbor search algorithms based on an &approxima-tion}elimination' framework under a class of elimination rules, namely, partial distance elimination, hypercube elimination and absolute-error-inequality elimination derived from approximations of

A survey on search-based software design
A survey on search-based software design
โœ Outi Rรคihรค ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier ๐ŸŒ English โš– 664 KB

This survey investigates search-based approaches to software design. The basics of the most popular meta-heuristic algorithms are presented as background to the search-based viewpoint. Software design is considered from a wide viewpoint, including topics that can also be categorized as software main