Sciweavers

3320 search results - page 285 / 664
» Heuristics for the Phylogeny Problem
Sort
View
ACSC
2005
IEEE
16 years 12 days ago
A Two-Pronged Attack on the Dragon of Intractability
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
Stephen Gilmour, Mark Dras
WABI
2010
Springer
178views Bioinformatics» more  WABI 2010»
15 years 5 months ago
Haplotype Inference on Pedigrees with Recombinations and Mutations
Abstract. Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies, such as functional genomics, pharmacogenetics and population ge...
Yuri Pirola, Paola Bonizzoni, Tao Jiang
DAC
1999
ACM
16 years 7 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
SIGMOD
2004
ACM
123views Database» more  SIGMOD 2004»
16 years 7 months ago
Automatic Categorization of Query Results
Exploratory ad-hoc queries could return too many answers ? a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically catego...
Kaushik Chakrabarti, Surajit Chaudhuri, Seung-won ...
PODS
2008
ACM
153views Database» more  PODS 2008»
16 years 7 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar