Entry Jiang:1994:ASS from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Jiang:1994:ASS,
author = "Tao Jiang and Ming Li",
title = "Approximating shortest superstrings with constraints",
journal = j-THEOR-COMP-SCI,
volume = "134",
number = "2",
pages = "473--491",
day = "21",
month = nov,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:34 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=134&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=134&issue=2&aid=1627",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Sci., McMaster Univ., Hamilton, Ont.,
Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; constraints; data
compression; data structures; DNA sequencing; greedy
algorithms; greedy-style algorithms; Hungarian
algorithm; negative strings; polynomial-time
approximation; shortest superstrings",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Approximating,
102(2)283
- approximation,
70(1)35,
74(1)19,
77(3)331,
79(1)151,
79(1)195,
79(1)227,
81(1)77,
84(2)151,
88(2)313,
92(2)269,
93(1)91,
94(1)63,
94(2)175,
100(1)243,
102(2)283,
103(1)107,
106(2)265,
107(1)145,
117(1)113,
123(1)95,
125(2)295,
125(2)345,
125(2)355,
127(2)269,
130(1)5,
133(1)65,
133(1)105,
133(1)141,
133(1)165,
134(1)51
- C4240C,
134(2)263,
134(2)287,
134(2)387,
134(2)403,
134(2)415,
134(2)427,
134(2)493,
134(2)529,
134(2)545,
134(2)559,
135(1)139,
135(1)155,
135(1)z,
135(2)361,
136(2)387,
136(2)419,
136(2)487,
136(2)507
- C6120,
71(3)419,
72(2)97,
72(2)147,
75(3)223,
76(1)53,
77(1)161,
79(2)275,
83(2)275,
84(1)107,
85(1)97,
87(1)115,
87(1)143,
91(2)239,
91(2)285,
92(1)191,
93(2)201,
94(1)1,
95(2)245,
96(1)249,
100(2)267,
101(2)177,
103(2)335,
104(1)89,
104(1)129,
106(1)21,
106(2)391,
107(1)121,
108(2)345,
109(1)257,
111(1)191,
112(1)99,
112(2)339,
113(1)35,
113(2)273,
116(1)59,
116(2)227,
116(2)359,
117(1)131,
117(1)303,
118(1)21,
118(1)81,
119(2)233,
119(2)331,
119(2)355,
120(1)101,
121(1)113,
122(1)263,
123(1)9,
124(1)93,
124(1)127,
124(1)149,
125(2)259,
127(2)387,
128(1)3,
129(2)397,
130(1)85,
130(1)139,
131(1)29,
131(2)295,
132(1)151,
132(1)377,
136(1)79,
136(1)109
- compression,
92(1)213,
92(1)z,
100(1)157,
117(1)187,
118(1)49,
119(2)247,
127(1)181,
132(1)403,
234(1)325
- constraint,
72(1)55,
75(3)347,
76(1)115,
90(2)391,
95(1)1,
97(1)105,
99(1)79,
105(1)27,
105(1)85,
109(1)225,
111(1)59,
116(1)117,
120(1)45,
122(1)165,
122(1)263,
125(1)3,
126(2)183,
127(2)351,
131(2)331,
133(2)205,
133(2)267,
134(2)287,
135(2)221
- file,
71(3)419,
72(2)97,
72(2)147,
75(3)223,
76(1)53,
77(1)161,
79(2)275,
83(2)275,
84(1)107,
85(1)97,
87(1)115,
87(1)143,
91(2)239,
91(2)285,
92(1)191,
93(2)201,
94(1)1,
95(2)245,
96(1)249,
100(2)267,
101(2)177,
103(2)335,
104(1)89,
104(1)129,
106(1)21,
106(2)391,
107(1)121,
108(2)345,
109(1)257,
111(1)191,
112(1)99,
112(2)339,
113(1)35,
113(2)273,
116(1)59,
116(2)227,
116(2)359,
117(1)131,
117(1)303,
118(1)21,
118(1)81,
119(2)233,
119(2)331,
119(2)355,
120(1)101,
121(1)113,
122(1)263,
123(1)9,
124(1)93,
124(1)127,
124(1)149,
125(2)259,
127(2)387,
128(1)3,
129(2)397,
130(1)85,
130(1)139,
131(1)29,
131(2)295,
132(1)151,
132(1)377,
136(1)79,
136(1)109
- greedy,
94(2)223,
123(2)377,
130(1)49,
130(1)73
- Jiang, Tao,
85(1)53,
99(2)301,
119(2)363,
125(2)243
- Li, Ming,
119(2)363
- negative,
72(2)147,
93(1)159,
93(2)265,
118(2)263
- organisation,
71(3)419,
72(2)97,
72(2)147,
75(3)223,
76(1)53,
77(1)161,
79(2)275,
83(2)275,
84(1)107,
85(1)97,
87(1)115,
87(1)143,
91(2)239,
91(2)285,
92(1)191,
93(2)201,
94(1)1,
95(2)245,
96(1)249,
100(2)267,
101(2)177,
103(2)335,
104(1)89,
104(1)129,
106(1)21,
106(2)391,
107(1)121,
108(2)345,
109(1)257,
111(1)191,
112(1)99,
112(2)339,
113(1)35,
113(2)273,
116(1)59,
116(2)227,
116(2)359,
117(1)131,
117(1)303,
118(1)21,
118(1)81,
119(2)233,
119(2)331,
119(2)355,
120(1)101,
121(1)113,
122(1)263,
123(1)9,
124(1)93,
124(1)127,
124(1)149,
125(2)259,
127(2)387,
128(1)3,
129(2)397,
130(1)85,
130(1)139,
131(1)29,
131(2)295,
132(1)151,
132(1)377,
136(1)79,
136(1)109
- polynomial-time,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179
- shortest,
79(1)151,
82(1)35,
84(1)127,
92(1)3,
108(2)251,
108(2)365,
112(2)215,
116(2)359,
125(2)205,
125(2)229
- string,
73(3)319,
73(3)329,
78(2)363,
81(2)189,
82(1)35,
83(2)287,
84(2)293,
86(2)325,
88(1)59,
92(1)3,
92(1)19,
92(1)87,
92(1)107,
92(1)145,
92(1)165,
92(1)191,
92(1)z,
92(2)249,
93(2)265,
107(1)121,
107(2)333,
112(2)383,
119(2)247,
119(2)363,
126(1)77,
129(2)293,
129(2)337,
131(2)295,
135(2)345
- superstring,
125(2)205
- time, polynomial-,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179