Sciweavers

668 search results - page 3 / 134
» Algorithmics and Applications of Tree and Graph Searching
Sort
View
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
13 years 11 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
13 years 2 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
ESA
2003
Springer
107views Algorithms» more  ESA 2003»
13 years 10 months ago
Automated Generation of Search Tree Algorithms for Graph Modification Problems
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
WALCOM
2010
IEEE
351views Algorithms» more  WALCOM 2010»
13 years 3 months ago
Pathwidth and Searching in Parameterized Threshold Graphs
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas...
IWPEC
2009
Springer
13 years 12 months ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
Peter Damaschke