z-logo
open-access-imgOpen Access
A multiple divide-and-conquer (MDC) algorithm for optimal alignments in linear space
Author(s) -
Xiaojun Guan,
Edward C. Uberbacher
Publication year - 1994
Publication title -
osti oai (u.s. department of energy office of scientific and technical information)
Language(s) - English
Resource type - Reports
DOI - 10.2172/10168027
Subject(s) - divide and conquer algorithms , dynamic programming , computer science , sequence (biology) , linear programming , space (punctuation) , limiting , multiple sequence alignment , algorithm , linear space , theoretical computer science , sequence alignment , mathematics , combinatorics , biology , mechanical engineering , biochemistry , gene , engineering , peptide sequence , genetics , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom