4860 search results - page 388 / 972 » SNPs Problems, Complexity, and Algorithms |
150
Voted
AI
2005
Springer
15 years 3 months ago
2005
Springer
We present a formal model for qualitative spatial reasoning with cardinal directions utilizing a co-ordinate system. Then, we study the problem of checking the consistency of a se...
125
Voted
JCB
2007
15 years 3 months ago
2007
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
108
Voted
LATIN
1998
Springer
15 years 7 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
139
Voted
ESANN
2007
15 years 5 months ago
2007
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
121
Voted
IPL
2008
15 years 3 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...