Entry Benson:1995:SEA from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Benson:1995:SEA,
author = "Gary Benson",
title = "A space efficient algorithm for finding the best
nonoverlapping alignment score",
journal = j-THEOR-COMP-SCI,
volume = "145",
number = "1--2",
pages = "357--369",
day = "10",
month = jul,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:12 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=145&issue=1-2&aid=1943",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition)",
corpsource = "Dept. of Math., Univ. of Southern California, Los
Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "best nonoverlapping alignment score; biological
context; chromosome; DNA; human disease; localizing
genes; maximum alignment score; pattern recognition;
protein molecules; single string; space efficient
algorithm",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- alignment,
143(1)137,
147(1)31,
182(1)233,
210(2)341
- best,
148(1)141
- C1250,
140(2)319,
145(1)329,
152(2)171,
154(2)165,
154(2)183,
154(2)203,
160(1)217,
163(1)117,
163(1)303,
173(2)349,
178(1)129,
178(1)225,
178(1)275,
180(1)115,
181(2)379
- context,
141(1)329,
141(1)331,
164(1)29,
164(1)123,
165(2)355,
192(2)201,
197(1)189
- DNA,
143(1)113,
185(1)3
- efficient,
140(2)291,
147(1)19,
147(1)249,
162(2)297,
168(1)121,
173(1)113,
180(1)169,
181(2)247,
187(1)231,
196(1)71,
196(1)131,
196(1)131-1,
196(1)259,
201(1)233,
203(1)123,
203(2)175,
226(1)105,
226(1)173
- finding,
145(1)317,
147(1)181,
157(2)273,
172(1)265,
172(1)303,
203(1)151
- human,
185(1)3
- maximum,
140(2)301,
147(1)181,
148(1)165,
150(1)1,
158(1)117,
164(1)277,
174(1)23,
181(1)91,
181(1)107,
181(2)307,
191(1)193,
196(1)201
- nonoverlapping,
152(2)269,
152(2)285
- pattern,
137(1)25,
138(1)113,
140(2)319,
141(1)53,
141(1)253,
141(1)283,
145(1)1,
145(1)159,
145(1)329,
147(1)19,
152(2)171,
154(2)165,
154(2)183,
154(2)203,
155(2)321,
155(2)349,
156(1)217,
158(1)177,
160(1)217,
163(1)117,
163(1)303,
172(1)281,
173(2)349,
178(1)129,
178(1)225,
178(1)275,
180(1)115,
181(2)379,
184(1)195,
185(1)47,
186(1)231,
192(1)3,
196(1)71,
197(1)171,
201(1)263,
205(1)243,
206(1)1
- protein,
180(1)115,
210(2)261
- recognition,
140(2)319,
143(1)73,
143(2)343,
145(1)329,
152(2)171,
154(2)165,
154(2)183,
154(2)203,
155(2)321,
156(1)281,
160(1)217,
163(1)117,
163(1)303,
172(1)209,
173(2)349,
175(2)349,
175(2)393,
178(1)129,
178(1)225,
178(1)275,
180(1)115,
180(1)269,
181(2)379,
197(1)189,
201(1)99
- single,
148(1)141,
154(2)225,
160(1)1,
160(1)305,
182(1)203,
193(1)75,
194(1)245
- string,
137(2)269,
141(1)53,
141(1)163,
143(1)113,
147(1)19,
154(2)203,
154(2)225,
155(2)425,
155(2)447,
158(1)177,
161(1)1,
161(1)123,
161(1)289,
163(1)117,
164(1)73,
164(1)299,
172(1)281,
178(1)129,
180(1)203,
181(1)159,
191(1)205,
191(1)219,
194(1)87,
211(1)339,
218(1)205