Sciweavers

8431 search results - page 58 / 1687
» Algorithmically Independent Sequences
Sort
View
ICCSA
2004
Springer
15 years 3 months ago
New Parameter for Balancing Two Independent Measures in Routing Path
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
EVOW
2006
Springer
15 years 1 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...
IPL
2006
105views more  IPL 2006»
14 years 9 months ago
Finding and counting cliques and independent sets in r-uniform hypergraphs
We present a matrix multiplication based algorithm for counting the number of (induced) occurrences of a fixed r-uniform hypergraph in a larger hypergraph. In many cases, the runn...
Raphael Yuster
BMCBI
2005
122views more  BMCBI 2005»
14 years 9 months ago
ASPIC: a novel method to predict the exon-intron structure of a gene that is optimally compatible to a set of transcript sequenc
Background: Currently available methods to predict splice sites are mainly based on the independent and progressive alignment of transcript data (mostly ESTs) to the genomic seque...
Paola Bonizzoni, Raffaella Rizzi, Graziano Pesole
AINA
2006
IEEE
15 years 3 months ago
Partitioned optimization algorithms for multiple sequence alignment
Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...
Yixin Chen, Yi Pan, Juan Chen, Wei Liu, Ling Chen