Entry Middendorf:1995:FVM 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{Middendorf:1995:FVM,
author = "Martin Middendorf",
title = "On finding various minimal, maximal, and consistent
sequences over a binary alphabet",
journal = j-THEOR-COMP-SCI,
volume = "145",
number = "1--2",
pages = "317--327",
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=1954",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity)",
corpsource = "Inst. f{\"u}r Angewandte Inf. und Formale
Beschreibungsverfahren, Karlsruhe Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary alphabet; complexity; computational complexity;
consistent sequences; longest minimal common
supersequence; MAX SNP-hard; shortest maximal common
subsequence",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxtitle = "On finding minimal, maximal, and consistent sequences
over a binary alphabet",
}
Related entries
- alphabet,
141(1)163,
143(2)269,
143(2)353,
147(1)19,
147(1)31,
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
- binary,
137(2)237,
138(1)67,
140(2)333,
141(1)283,
141(1)311,
143(2)353,
144(1)251,
145(1)45,
145(1)271,
146(1)243,
147(1)1,
150(1)77,
154(1)41,
155(2)425,
156(1)39,
156(1)315,
158(1)53,
158(1)81,
160(1)305,
169(1)67,
172(1)135,
174(1)67,
177(1)3,
179(1)251,
179(1)301,
180(1)47,
181(1)119,
181(1)181,
182(1)145,
188(1)1,
188(1)241,
197(1)111,
218(1)161,
220(2)363
- common,
143(1)113,
143(2)353,
144(1)3,
147(1)31,
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
- consistent,
141(1)151,
143(1)113,
149(2)361,
165(2)233,
194(1)225,
194(1)243-2
- finding,
145(1)357,
147(1)181,
157(2)273,
172(1)265,
172(1)303,
203(1)151
- hard;, SNP-,
143(1)137,
143(2)353
- longest,
143(1)113,
143(2)353,
147(1)31,
185(1)47,
196(1)395
- MAX,
143(1)137,
147(1)181
- maximal,
143(2)309,
146(1)331,
147(1)19,
148(1)57,
161(1)1,
166(1)83,
175(2)257,
181(1)91,
183(1)3,
188(1)231,
191(1)117,
193(1)53,
204(1)11,
215(1)89,
218(1)107,
218(2)273
- Middendorf, Martin,
164(1)73,
191(1)205,
215(1)137
- minimal,
139(1)187,
143(1)1,
143(1)175,
151(1)37,
155(1)157,
155(2)425,
159(1)43,
164(1)59,
165(2)441,
166(1)83,
166(1)147,
171(1)281,
173(1)89,
174(1)171,
175(2)293,
175(2)309,
176(1)337,
180(1)169,
182(1)1,
183(1)93,
187(1)27,
187(1)167,
188(1)175,
190(2)151,
192(2)233,
193(1)75,
194(1)247-2,
212(1)77,
215(1)345,
218(1)161
- sequence,
139(1)27,
143(2)335,
144(1)101,
145(1)291,
147(1)31,
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
- shortest,
140(2)265,
140(2)291,
143(1)113,
143(2)343,
143(2)353,
144(1)161,
161(1)123,
168(1)121,
172(1)303,
182(1)183,
186(1)171,
191(1)205,
203(1)143,
203(2)205,
207(1)105,
209(1)287
- SNP-hard,
143(1)137,
143(2)353
- subsequence,
147(1)31,
164(1)277,
165(2)233
- supersequence,
165(2)233
- various,
174(1)259,
212(1)261,
266(1)997