Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Eagu Kim

dblp:47/4840 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
protein structure prediction
0.112009
Learning Models for Aligning Protein Sequences with Predicted Secondary Structure · RECOMB 2009
Bioinformatics and computational biology › structural bioinformatics
sequence-structure alignment
0.112009
Learning Models for Aligning Protein Sequences with Predicted Secondary Structure · RECOMB 2009
Bioinformatics and computational biology
sequence alignment
0.112006
Simple and Fast Inverse Alignment · RECOMB 2006
Algorithms and data structures › sequence algorithms › string algorithms
sequence alignment algorithm
0.112006
Simple and Fast Inverse Alignment · RECOMB 2006

Methods — techniques the papers use, named apart from their topics

secondary structure prediction · 0.1machine learning · 0.1
YearPublicationVenuePosition
2009 Learning Models for Aligning Protein Sequences with Predicted Secondary Structure
Eagu Kim, Travis J. Wheeler, John D. Kececioglu
RECOMB1
2008 Learning Scoring Schemes for Sequence Alignment from Partial Examples
abstract
When aligning biological sequences, the choice of parameter values for the alignment scoring function is critical. Small changes in gap penalties, for example, can yield radically different alignments. A rigorous way to compute parameter values that are appropriate for aligning biological sequences is through inverse parametric sequence alignment. Given a collection of examples of biologically correct alignments, this is the problem of finding parameter values that make the scores of the example alignments close to those of optimal alignments for their sequences. We extend prior work on inverse parametric alignment to partial examples, which contain regions where the alignment is left unspecified, and to an improved formulation based on minimizing the average error between the score of an example and the score of an optimal alignment. Experiments on benchmark biological alignments show we can find parameters that generalize across protein families and that boost the accuracy of multiple sequence alignment by as much as 25 percent.
Eagu Kim, John D. Kececioglu
IEEE ACM Trans. Comput. Biol. Bioinform.1
2007 Inverse Sequence Alignment from Partial Examples
Eagu Kim, John D. Kececioglu
WABI1
2006 Simple and Fast Inverse Alignment
John D. Kececioglu, Eagu Kim
RECOMB2