Sciweavers

13 search results - page 1 / 3
» Reconstructing Evolution of Natural Languages: Complexity an...
Sort
View
COCOON
2006
Springer
13 years 8 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
BIOSYSTEMS
2008
129views more  BIOSYSTEMS 2008»
13 years 4 months ago
Reconstruction of DNA sequences using genetic algorithms and cellular automata: Towards mutation prediction?
Change of DNA sequence that fuels evolution is, to a certain extent, a deterministic process because mutagenesis does not occur in an absolutely random manner. So far, it has not ...
Ch. Mizas, Georgios Ch. Sirakoulis, Vasilios A. Ma...
ICALP
2007
Springer
13 years 10 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
ICALP
2010
Springer
13 years 6 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 4 months ago
Problem Solving and Complex Systems
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
Frédéric Guinand, Yoann Pigné