AbnerCYH's string [7 articles] Export

Recent papers added to AbnerCYH's library classified by the tag string. You can also see everyone's string.

	Average running time of the Boyer-Moore-Horspool algorithm [My Copy] Theoretical Computer Science, Vol. 92, No. 1. (6 January 1992), pp. 19-31. by R. Baeza-Yates posted to algorithms complexity string by AbnerCYH on 2008-11-16 20:17:12 as
	Average case analysis of the Boyer-Moore algorithm [My Copy] Random Structures and Algorithms, Vol. 28, No. 4. (2006), pp. 481-498. by Tsung-Hsi Tsai posted to algorithms complexity string by AbnerCYH on 2008-11-16 20:16:52 as
	Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays [My Copy] Algorithmica, Vol. 52, No. 3. (1 November 2008), pp. 350-377. by Dong Kim, Minhwan Kim, Heejin Park posted to algorithms data_structure string by AbnerCYH on 2008-11-10 14:54:20 as along with 1 person mmartin
	DNA motif representation with nucleotide dependency. [My Copy] IEEE/ACM transactions on computational biology and bioinformatics / IEEE, ACM, Vol. 5, No. 1. (r 2008), pp. 110-119. by F. Chin, H. C. Leung posted to algorithms biology string by AbnerCYH on 2008-02-20 11:30:39 as along with 4 people wowalz maximilianh xili03 Stew
	On The Parameterized Intractability Of Motif Search Problems [My Copy] Combinatorica, Vol. 26, No. 2. (30 April 2006), pp. 141-167. by Michael Fellows, Jens Gramm, Rolf Niedermeier posted to biology combinatorics complexity graph parameterized string by AbnerCYH on 2007-11-10 19:08:20 as along with 1 person wowalz
	On the Parameterized Intractability of CLOSEST SUBSTRING and Related Problems [My Copy] STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002. Proceedings In STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002. Proceedings (2002), pp. 734-734. by Michael R. Fellows, Jens Gramm, Rolf Niedermeier posted to algorithms complexity parameterized string by AbnerCYH on 2007-11-10 12:15:48 as
	Optimal spaced seeds for faster approximate string matching [My Copy] Journal of Computer and System Sciences In Bioinformatics III, Vol. 73, No. 7. (November 2007), pp. 1035-1044. by Martin Farach-Colton, Gad M. Landau, Cenk S. Sahinalp, Dekel Tsur posted to algorithms information optimization string by AbnerCYH on 2007-08-03 18:04:34 as along with 1 person and 1 group nedwards CSBBGraphTheory

Note: You may cite this page as: http://www.citeulike.org/user/AbnerCYH/tag/string

algorithms	687
graph	478
complexity	189
combinatorics	150
biology	128
kdd	128
math	127
complex	125
stochastic	113
topology	82
optimization	63
geometries	62
order	61
algebra	56
data_structure	52
dynamics	43
parameterized	38
testing	32
information	28
logic	27
automata	22
game	19
parallel	18
distributed	15
economic	14
sys_performance	14
string	7
neuro	6
history	4

AbnerCYH's string [7 articles] Export

AbnerCYH's tags