Sciweavers

457 search results - page 43 / 92
» A relative trust-region algorithm for independent component ...
Sort
View
DIS
2008
Springer
14 years 11 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
CANDC
2005
ACM
14 years 9 months ago
Comments on selected fundamental aspects of microarray analysis
Microarrays are becoming a ubiquitous tool of research in life sciences. However, the working principles of microarray-based methodologies are often misunderstood or apparently ig...
Alessandra Riva, Anne-Sophie Carpentier, Bruno Tor...
BMCBI
2010
104views more  BMCBI 2010»
14 years 9 months ago
FragViz: visualization of fragmented networks
Background: Researchers in systems biology use network visualization to summarize the results of their analysis. Such networks often include unconnected components, which popular ...
Miha Stajdohar, Minca Mramor, Blaz Zupan, Janez De...
BMCBI
2007
183views more  BMCBI 2007»
14 years 9 months ago
Considerations in the identification of functional RNA structural elements in genomic alignments
Background: Accurate identification of novel, functional noncoding (nc) RNA features in genome sequence has proven more difficult than for exons. Current algorithms identify and s...
Tomas Babak, Benjamin J. Blencowe, Timothy R. Hugh...
COCOON
2007
Springer
15 years 3 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...