WEA 2010 - PDF Preprint Papers

WEA 2010 International Workshop on Experimental and E cient Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WEA-2010 Paper

click to vote

WEA
2010
Springer

286views Algorithms» more WEA 2010»

Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments

2 years 5 days ago

Download www.cs.dal.ca

We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...

Chris Whidden, Robert G. Beiko, Norbert Zeh

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	286	Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments	claim
2	227	Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure	claim
3	168	A New Combinational Logic Minimization Technique with Applications to Cryptology	claim
4	144	Exact Bipartite Crossing Minimization under Tree Constraints	claim
5	127	Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem	claim
6	122	Geometric Minimum Spanning Trees with GeoFilterKruskal	claim
7	109	Alternative Routes in Road Networks	claim
8	107	Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs	claim
9	103	New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery	claim
10	101	Practical Nearest Neighbor Search in the Plane	claim
11	100	Contraction of Timetable Networks with Realistic Transfers	claim
12	99	Realtime Classification for Encrypted Traffic	claim
13	92	A Branch-and-Price Algorithm for Multi-mode Resource Leveling	claim
14	89	Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems	claim
15	86	Experiments with a Feasibility Pump Approach for Nonconvex MINLPs	claim
16	85	Distributed Time-Dependent Contraction Hierarchies	claim
17	84	Modularity-Driven Clustering of Dynamic Graphs	claim
18	80	Randomized Rounding for Routing and Covering Problems: Experiments and Improvements	claim
19	74	Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries	claim
20	51	Practical Compressed Suffix Trees	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers