CS 511A: Introduction to Artificial Intelligence, Fall 2004
Place: Cupples II 217
Time: Monday and Wednesday, 1:00PM 2:30PM
Instructor: Weixiong
Zhang
TA: TBA
Text book: Stuart Russell and Peter Norvig, Artificial
Intelligence: A Modern Approach, Prentice Hall, 2nd Edition,
2003.
Office hours:
- Weixiong Zhang: M-W 2:30 -
3:30 pm (after classes), Jolley Hall 506
- TA sessions: Ali
Gardezi: M-W 4-5pm (Urbauer 114); Brian Haynes T-T 4-5pm (Urbauer 114)
Additional reading
Heuristic search
algorithms, Chapter 2 of State-space Search, Springer, 1999.
Divide-and-conquer frontier
search (for multiple sequence alignment)
Homeworks
HW5, due on Dec. 13, submit a
hardcopy to Jolley 506
Project
due on Dec. 15. A hardcopy of report and your program through
email, all due by 1:00pm Jolley 506. Attach a readme file
specifying how to compile and run your program.
Please
enter your course evaluation on WebFac as soon as possible - thanks!
Sample input file to your program
sample 1 - pairwise alignment
2 20
32113311130022111032
30113302312233032100
(note: the first line specifies the number of sequences and their
lengths - here, 2 is for pairwise alignment and 20 is the length of two
sequences, assuming they have the same length)
sample 1 - three-way alignment
3
20
11102120323303020120
11233232230001023322
11121201331003032310
(note: this is for a three-way alignment of length 20)
Sample test cases for the project
(your algorithm and algorithm will
be tested on arbitrary strings of any lengths)
Pairwise alignment
length
20 -----------
sequences:
32113311130022111032
30113302312233032100
possible solution:
3 2 1 1 3 3 - 1 1 1 3 0 0 2 2
1 1 1 0 3 2
3 0 1 1 3 3 0 2 3 1 2 2 3 3 0 3 2 1
0 - 0
cost = 15
sequences:
32131320112323320200
30312223331222131032
possible solution:
3
- 2 1 3 1 3 2 0 1 1 2 3 2 3 3 2 0 2 0 0
3 0 3 1 2 2 2 3 3 3 1 2 2 2 1 3 1 0
3 - 2
cost = 16
sequences:
23031201132311112132
20133322031222100111
possible solution:
2
3 0 3 1 2 0 1 1 3 2 3 1 1 1 1 2 1 3 2
2 0 1 3 3 3 2 2 0 3 1 2 2 2 1 0 0 1
1 1
cost = 15
length 100 -----------
sequences:
0300032321031213030102332012222213212100210331200211000201123300231001122112232213323303012312331001
2130202030213232132210122110111321001201332211120301323131102301001122211002110201333302022212312121
possible solution:
0
3 0 0 0 3 2 3 2 1 0 3 1 2 1 3 0 3 0 1 0 2 3 3 2 0 1 2 2 2 2 2 1 3 2 1 2
1 0 0 2 1 0 3 3 1 2 0 0 2 1 1 0 0 0 2 0 1 1 2 3 3 0 0 2 3 - 1 0 0 1 1 -
2 2 1 1 - - 2 2 3 2 2 1 3 3 2 3 3 0 3 0 1 2 3 1 2 3 3 1 0 0 1
2 1 3 0 - - 2 0 2 - 0 3 0 2 1 3 2 3 2 1 3 2 2 1 - 0 1 2 2 1 1 0 1 1 1 3
2 1 0 0 1 2 0 1 3 3 2 2 1 1 1 2 0 3 0 1 3 2 3 1 3 1 1 0 2 3 0 1 0 0 1 1
2 2 2 1 1 0 0 2 1 1 0 2 0 1 3 3 3 3 0 2 0 2 2 2 1 2 3 1 2 1 2 1
cost = 61
sequences:
2313133320001122330211020120020211121113123332121202301313321303121233101130313033220311303000312131
0011111020010330201101201113200211322130131120110321001123003030123032011220201333030102002001010313
possible solution:
2
3 1 3 1 3 3 3 2 0 0 0 1 1 2 2 3 3 0 2 1 1 0 2 0 1 2 0 0 2 0 2 1 1 1 2 1
1 1 3 1 2 3 3 3 2 1 2 1 2 0 2 3 0 1 3 1 3 3 2 1 3 0 3 - 1 2 1 2 3 3 1 0
1 1 3 0 3 1 3 0 3 3 2 2 0 3 1 1 3 0 3 0 0 0 3 1 2 1 3 1
0 0 1 1 1 1 1 0 2 0 0 - 1 0 3 3 0 2 0 1 1 0 1 2 0 1 1 1 3 2 0 0 2 1 1 3
2 2 1 3 0 1 3 1 1 2 0 1 1 0 3 2 1 0 0 1 1 2 3 0 0 3 0 3 0 1 2 3 0 3 2 0
1 1 2 2 0 2 0 1 3 3 3 0 3 0 1 0 2 0 0 2 0 0 1 0 1 0 3 1 3
cost = 64
sequences:
1202002310001020132332113102021101301132102201310103020330232302032112322212303310312311030220123330
1233001301311233100130010133020203113303030113033002003012320301212102002113012013213211013103230001
possible solution:
1
2 0 2 0 0 2 3 1 0 0 0 1 0 2 0 1 3 2 3 3 2 1 1 3 1 0 2 0 2 1 1 0 1 3 0 1
1 3 2 1 0 2 2 0 1 3 1 0 1 0 3 0 2 0 3 3 0 2 3 2 - 3 0 2 0 3 2 1 1 2 3 2
2 2 1 2 3 0 3 3 1 0 3 1 2 3 1 1 0 3 0 2 2 0 1 2 3 3 3 0 -
1 2 3 3 0 0 1 3 0 1 3 1 1 2 3 3 1 0 0 1 3 0 0 1 0 1 3 3 0 2 0 2 0 - 3 1
1 3 3 0 3 0 3 0 1 1 3 0 3 3 0 0 2 0 0 3 0 1 2 3 2 0 3 0 1 2 1 2 1 0 2 0
0 2 1 1 3 0 1 2 0 1 3 2 1 3 2 1 1 0 1 3 1 - 0 3 2 3 0 0 0 1
cost = 65
Three-way alignment
length
20 -----------
11102120323303020120
11233232230001023322
11121201331003032310
cost = 37
21303132333333312330
12301113022231233212
10103112002131102333
cost = 40
10131310102302012113
03133133113220130331
31033112221212203130
cost = 46
length 100 -----------
2311200001023320102033323310223120200200002301011210112103122130120200200100201323000210222032010030
0110211012031031201030022032022003120231031230311120122332130300313332131210211323332221030020111010
2203013220200132313303030101112332233122102112313200203213321110330302122333130111131013311023122113
cost = 217
1110212032330302012011233232230001023322111212013310030323102202310202010231002333333331201022223203
1101302300233122113321003222131201331121100013320222323201010130323031201213101223021302113123211121
3010223021210232230303032200021322311313030013233223232013011100001132031132022300323131032213213322
cost = 204
2130313233333331233012301113022231233212101031120021311023331110303220031130212210302110003121111133
1322013321102100210220301012101333130023203013031013003100320013322031311212111212122032030031330233
3200012123031113211202333223012332333111011122003233023301313102002313120232003022320210001322122313
cost = 214
1013131010230201211303133133113220130331310331122212122031303221300333020110222003211011201130220213
1111221013012330301112202022231302131232203032023100020232111211120200020333231111110133300031103220
2222111312020130223133121320100323130231033012031310322010020112021000210111020111100301310321120220
cost = 207
Created by Weixiong Zhang,
August 2004.
Last modified by Weixiong
Zhang, Nov. 2004.