Sciweavers

804 search results - page 23 / 161
» Solutions to Computational Problems Through Gene Assembly
Sort
View
RECOMB
2010
Springer
14 years 2 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
NETCOOP
2007
Springer
14 years 1 months ago
Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions
Recently Gerald Ash has shown through case studies that event dependent routing is attractive in large scale multi-service MPLS networks. In this paper, we consider the application...
Gilles Brunet, Fariba Heidari, Lorne Mason
RECOMB
2008
Springer
14 years 8 months ago
Internal Validation of Ancestral Gene Order Reconstruction in Angiosperm Phylogeny
Abstract. Whole genome doubling (WGD), a frequent occurrence during the evolution of the angiopsperms, complicates ancestral gene order reconstruction due to the multiplicity of so...
David Sankoff, Chunfang Zheng, P. Kerr Wall, Claud...
PPSN
2004
Springer
14 years 1 months ago
Searching Transcriptional Modules Using Evolutionary Algorithms
The mechanism of gene regulation has been studied intensely for decades. It is important to identify synergistic transcriptional motifs. Its search space is so large that an effici...
Je-Gun Joung, Sok June Oh, Byoung-Tak Zhang
COR
2008
99views more  COR 2008»
13 years 7 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi