Gap Penalty Optimization
Gap Penalty Optimization is a computational method in sequence alignment that determines the optimal values for gap penalties by balancing the trade-off between alignment accuracy and biological plausibility, distinguishing it from other alignment strategies through its focus on systematically refining gap cost parameters to enhance global or local homology inference.
39
Publications
4.5K
Citations
88
Authors
53
Institutions
Publications per year
2017–2026
4
Parents
39
Optimal alignments in linear space
Eugene W. Myers, Webb Miller · Computer applications in the biosciences · 1988 · 1.2K citations
Jiye Shi, Tom L. Blundell, Kenji Mizuguchi · Journal of Molecular Biology · 2001 · 1.2K citations
1–5 of 39
88
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 88
53
Saitama Cancer Center
Saitama, Japan
2 h-index
2 publications
171 citations

Monash University
Melbourne, Australia
2 h-index
4 publications
77 citations
The University of Texas at Austin
Austin, United States
2 h-index
8 publications
233 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
8 publications
208 citations
University of California San Diego
San Diego, United States
2 h-index
2 publications
71 citations
University of Wisconsin–Madison
Madison, United States
2 h-index
2 publications
80 citations
University of Arizona
Tucson, United States
2 h-index
6 publications
1.3K citations
National Institutes of Health
Bethesda, United States
1 h-index
1 publications
22 citations
1–8 of 53
6 publications · 538 citations
6
h-index
PEDS · 3 publications · 206 citations
3
h-index
3 publications · 173 citations
3
h-index
JMB · 2 publications · 1.3K citations
2
h-index
MBE · 2 publications · 198 citations
2
h-index
1–5