论文列表及评分结果
On the Intractability of Protein Folding with a Finite Alphabet of Amino Acids.
电商所评分：10
Mass Estimation of DNA Molecules and Extraction of Ordered Restriction Maps in Optical Mapping Imagery.
电商所评分：5
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem.
电商所评分：7
An Algorithm for Identifying Similar Amino Acid Clusters among Different Alpha-Helical Coiled-Coil Proteins Using Their Secondary Structure.
电商所评分：10
Computational Approaches to Drug Design.
电商所评分：9
Computer Algebra Methods for Studying and Computing Molecular Conformations.
电商所评分：4
On the Influence of Lookahead in Competitive Paging Algorithms.
电商所评分：1
Trekking in the Alps Without Freezing or Getting Tired.
电商所评分：1
Combine and Conquer.
电商所评分：4
Multicommodity Flows in Even, Planar Networks.
电商所评分：7
An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem.
电商所评分：10
The Bit Complexity of Distributed Sorting.
电商所评分：8
Routing on Meshes with Buses.
电商所评分：1
Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks.
电商所评分：1
On Algorithm Design for Metrical Task Systems.
电商所评分：10
Wait-Free Clock Synchronization.
电商所评分：9
Detecting False Matches in String-Matching Algorithms.
电商所评分：3
Equivalence of Binary and Ternary Algebraic Decision Trees.
电商所评分：8
On Constructing Minimum Spanning Trees in Rkl.
电商所评分：1
A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs.
电商所评分：10
A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors.
电商所评分：5
Optimal Graph Constraint Reduction for Symbolic Layout Compaction.
电商所评分：5
Hexagonal Models for Channel Routing.
电商所评分：10
Parallel Searching in Generalized Monge Arrays.
电商所评分：5
Expansion of Linear Steiner Trees.
电商所评分：4
From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction.
电商所评分：4
Parallel Algorithms for Maximal Acyclic Sets.
电商所评分：9
Tree-Based Parallel Algorithm Design.
电商所评分：2
On Implementing the Push-Relabel Method for the Maximum Flow Problem.
电商所评分：1
A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound.
电商所评分：8