Sciweavers

293 search results - page 24 / 59
» Fixed-Parameter Algorithms in Phylogenetics
Sort
View
ISMDA
2005
Springer
15 years 5 months ago
Using Treemaps to Visualize Phylogenetic Trees
Over recent years the field of phylogenetics has witnessed significant algorithmic and technical progress. A new class of efficient phylogeny programs allows for computation of l...
Adam Arvelakis, Martin Reczko, Alexandros Stamatak...
SYRCODIS
2008
136views Database» more  SYRCODIS 2008»
15 years 1 months ago
Stochastic Approach to Binary Matrix Partitioning for Phylogenetic Networks
In this research we introduce the problem of the binary matrix partitioning in a biological context. Our idea is to use SNP matrix to construct a set of phylogenetic networks to r...
Victoria Kusherbaeva, Nikolay Vyahhi
RECOMB
2006
Springer
16 years 3 days ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
RECOMB
2005
Springer
16 years 3 days ago
Constructing a Smallest Refining Galled Phylogenetic Network
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary his...
Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguy...
BMCBI
2006
144views more  BMCBI 2006»
14 years 12 months ago
More robust detection of motifs in coexpressed genes by using phylogenetic information
Background: Several motif detection algorithms have been developed to discover overrepresented motifs in sets of coexpressed genes. However, in a noisy gene list, the number of ge...
Pieter Monsieurs, Gert Thijs, Abeer A. Fadda, Sigr...