1243 search results - page 201 / 249 » Generating Trees on Multisets |
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
We have developed a multiple genome alignment algorithm by using a sequence clustering algorithm to combine local pairwise genome sequence matches produced by pairwise genome align...
PODS
2002
ACM
15 years 10 months ago
2002
ACM
Research on information extraction from Web pages (wrapping) has seen much activity in recent times (particularly systems implementations), but little work has been done on formal...
ICSE
2004
IEEE-ACM
15 years 9 months ago
2004
IEEE-ACM
Caring for security at requirements engineering time is a message that has finally received some attention recently. However, it is not yet very clear how to achieve this systemat...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Information extraction systems are traditionally implemented as a pipeline of special-purpose processing modules. A major drawback of such an approach is that whenever a new ex...