Sciweavers

804 search results - page 20 / 161
» Solutions to Computational Problems Through Gene Assembly
Sort
View
PARA
2004
Springer
14 years 1 months ago
Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning
Abstract. We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for construct...
Keita Teranishi, Padma Raghavan
IFIP
2004
Springer
14 years 1 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
ESCIENCE
2006
IEEE
14 years 1 months ago
An Extended Extremal Optimisation Model for Parallel Architectures
: A relatively new meta-heuristic, known as extremal optimisation (EO), is based on the evolutionary science notion that poorly performing genes of an individual are replaced by ra...
Marcus Randall, Andrew Lewis
ISBRA
2009
Springer
14 years 2 months ago
Prediction of Contiguous Regions in the Amniote Ancestral Genome
Abstract. We investigate the problem of inferring contiguous ancestral regions (CARs) of the genome of the last common ancestor of all extant amniotes, based on the currently seque...
Aïda Ouangraoua, Frédéric Boyer...
SAC
2010
ACM
13 years 2 months ago
Convex onion peeling genetic algorithm: an efficient solution to map labeling of point-feature
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the ...
Wan D. Bae, Shayma Alkobaisi, Petr Vojtechovsk&yac...