535 search results - page 36 / 107 » Insertion and Expansion Operations for |
107
click to vote
ICALP
2009
Springer
16 years 2 days ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
198
click to vote
VLDB
2005
ACM
16 years 1 days ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
BICOB
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. ...
ICIC
2009
Springer
15 years 6 months ago
2009
Springer
Sequence Alignment is a basic information disposal method in Bioinformatics. However, it is difficult to deal with multiple sequence alignment problem(MSA). In this paper, an impro...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Multiobjective optimization problems with many local Pareto fronts is a big challenge to evolutionary algorithms. In this paper, two operators, biased initialization and biased cr...