Low-cost whole-genome assembly has enabled the collection of haplotype-resolved
pangenomes for numerous organisms. In turn, this technological change is encouraging the …

Background This article provides an overview of the first BioASQ challenge, a competition
on large-scale biomedical semantic indexing and question answering (QA), which took …

A new approach to rapid sequence comparison, basic local alignment search tool (BLAST),
directly approximates alignments that optimize a measure of local similarity, the maximal …

The inverse protein folding problem, the problem of finding which amino acid sequences
fold into a known three-dimensional (3D) structure, can be effectively attacked by finding …

A potent neurotrophic factor that enhances survival of midbrain dopaminergic neurons was
purified and cloned. Glial cell line-derived neurotrophic factor (GDNF) is a glycosylated …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Levenshtein edit distance has played a central role-both past and present-in sequence
alignment in particular and biological database similarity search in general. We start our …

An unusual pattern in a nucleic acid or protein sequence or a region of strong similarity
shared by two or more sequences may have biological significance. It is therefore desirable …

A new approach to rapid sequence comparison, basic local alignment search tool (BLAST),
directly approximates alignments that optimize a measure of local similarity, the maximal …

Offering a fundamental basis in kernel-based learning theory, this book covers both
statistical and algebraic principles. It provides over 30 major theorems for kernel-based …