Entry Bodlaender:1995:PCS 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{Bodlaender:1995:PCS,
author = "Hans L. Bodlaender and Rodney G. Downey and Michael R.
Fellows and Harold T. Wareham",
title = "The parameterized complexity of sequence alignment and
consensus",
journal = j-THEOR-COMP-SCI,
volume = "147",
number = "1--2",
pages = "31--54",
day = "07",
month = aug,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:16 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&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=147&issue=1-2&aid=1885",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4240C (Computational complexity)",
corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabet; asymptotic model; computational complexity;
feasible computability; fixed size alphabets;
fixed-parameter tractability; formal languages; longest
common subsequence problem; parameterized computational
complexity; parameters; sequence alignment; sequence
consensus; sequences; unrestricted alphabet sizes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alignment,
143(1)137,
145(1)357,
182(1)233,
210(2)341
- alphabet,
141(1)163,
143(2)269,
143(2)353,
145(1)317,
147(1)19,
154(1)57,
154(2)225,
154(2)387,
155(2)425,
164(1)277,
174(1)157,
174(1)171,
177(2)425,
178(1)1,
180(1)81,
180(1)181,
186(1)135,
195(1)91,
197(1)235,
209(1)163,
210(2)245
- asymptotic,
143(2)343,
144(1)3,
144(1)101,
144(1)161,
144(1)277,
147(1)267,
149(1)67,
156(1)301,
159(1)65,
164(1)185,
164(1)277,
181(2)307,
187(1)81,
187(1)263,
190(2)151,
215(1)371,
218(2)249
- Bodlaender, Hans L.,
148(1)93,
209(1)1
- common,
143(1)113,
143(2)353,
144(1)3,
145(1)317,
147(1)267,
154(2)225,
155(1)265,
157(1)3,
162(2)173,
164(1)277,
177(1)111,
191(1)205,
194(1)241-3,
207(2)319
- computability,
137(1)129,
139(1)243,
142(1)27,
145(1)111,
153(1)49,
154(2)145,
155(1)277,
157(1)79,
157(1)91,
157(2)267,
160(1)365,
161(1)109,
161(1)289,
162(1)5,
162(1)23,
162(1)45,
162(1)117,
163(1)177,
165(1)133,
166(1)147,
168(2)241,
168(2)461,
171(1)3,
172(1)233,
174(1)137,
175(1)183,
175(2)349,
181(1)195,
184(1)195,
190(2)279,
191(1)145,
191(1)229,
192(2)315,
193(1)149,
194(1)219,
194(1)247-1,
195(2)183,
210(1)73,
219(1)65,
219(1)185,
219(1)287,
219(1)421,
219(1)467,
219(1)487,
224(1)173
- consensus,
145(1)271,
180(1)115,
185(2)259,
220(1)3
- Downey, Rodney G.,
191(1)97,
209(1)123
- feasible,
138(1)201,
140(2)231,
147(1)181,
207(1)245,
225(1)185
- Fellows, Michael R.,
141(1)109,
191(1)97,
209(1)123
- fixed,
138(2)273,
139(1)1,
142(2)257,
148(1)33,
148(1)67,
150(1)57,
151(1)3,
154(2)203,
155(1)1,
160(1)1,
160(1)87,
161(1)301,
172(1)265,
178(1)265,
179(1)1,
183(1)21,
187(1)49,
189(1)1,
193(1)53,
193(1)215,
195(1)61,
215(1)359,
217(2)301,
222(1)181
- fixed-parameter,
141(1)109
- longest,
143(1)113,
143(2)353,
145(1)317,
185(1)47,
196(1)395
- parameter,
144(1)125,
150(1)111,
155(1)141,
159(1)65,
172(1)233,
183(2)215,
187(1)147,
187(1)249,
215(1)289,
224(1)13
- parameter, fixed-,
141(1)109
- parameterized,
141(1)109,
154(2)203,
170(1)245,
183(2)187,
191(1)97
- sequence,
139(1)27,
143(2)335,
144(1)101,
145(1)291,
145(1)317,
148(1)1,
150(1)77,
151(1)163,
151(1)277,
155(2)321,
156(1)39,
158(1)35,
158(1)65,
158(1)81,
161(1)289,
163(1)193,
163(1)211,
164(1)165,
165(2)233,
165(2)295,
168(2)267,
168(2)337,
170(1)349,
174(1)67,
174(1)171,
174(1)259,
178(1)155,
180(1)115,
180(1)203,
182(1)145,
182(1)233,
183(1)143,
184(1)61,
185(1)3,
188(1)161,
188(1)195,
191(1)185,
191(1)245,
194(1)240,
194(1)241-2,
194(1)244-2,
197(1)244-1,
205(1)337,
207(2)343,
207(2)363,
209(1)179,
209(1)261,
209(1)377,
210(2)305,
210(2)341,
215(1)31,
218(1)3,
218(1)177,
221(1)41,
225(1)185
- size,
141(1)283,
145(1)45,
147(1)137,
147(1)267,
148(1)93,
158(1)193,
168(1)105,
170(1)129,
172(1)1,
179(1)301,
180(1)47,
187(1)147,
196(1)259,
197(1)139,
209(1)47,
209(1)141,
209(1)225
- subsequence,
145(1)317,
164(1)277,
165(2)233
- tractability,
141(1)109,
170(1)129,
192(2)315
- unrestricted,
176(1)39,
180(1)203