Skip to main navigation
Skip to search
Skip to main content
University of Arizona Home
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Grants
Datasets
Prizes
Search by expertise, name or affiliation
Making the shortest-paths approach to Sum-of-Pairs multiple sequence alignment more space efficient in practice (Extended Abstract)
Sandeep K. Gupta
,
John D. Kececioglu
, Alejandro A. Schäffer
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
12
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Making the shortest-paths approach to Sum-of-Pairs multiple sequence alignment more space efficient in practice (Extended Abstract)'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Multiple Sequence Alignment
100%
Space Use
100%
Extended Abstracts
100%
Sum of Pairs
100%
Shortest Path Approach
100%
Order of Magnitude
50%
DNA Sequencing
50%
Dynamic Programming
50%
Protein Sequence
50%
Optimal Alignment
50%
Dijkstra's Shortest Path Algorithm
50%
Multiple Proteins
50%
Multiplicative Factors
50%
Time Consumption
50%
Branch-and-bound Method
50%
Computer Science
Dynamic Programming
100%
Optimal Alignment
100%
Shortest Path Algorithm
100%
Sequence Alignment
100%
Branch-and-Bound Algorithm Design
100%
Multiplicative Factor
100%