Sciweavers

1356 search results - page 4 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
BMCBI
2006
141views more  BMCBI 2006»
13 years 6 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
EJC
2008
13 years 6 months ago
Some existence and construction results of polygonal designs
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...
Gargi Bhattacharyya, John Hegeman, Joohyung Kim, J...
JDCTA
2010
92views more  JDCTA 2010»
13 years 1 months ago
Several Incomplete Sort Algorithms for Getting the Median Value
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
Fuguo Dong
RECOMB
2006
Springer
14 years 6 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 6 months ago
State Elimination Ordering Strategies: Some Experimental Results
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
Nelma Moreira, Davide Nabais, Rogério Reis