Infinite string block matching features for DNA classification

Ashlock, Daniel; Gillis, Sierra; Ashlock, Wendy

doi:10.1109/cibcb.2017.8058529

Cited by 4 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The DWP problem was also used to evolve entropically rich binary strings and a type of classification character for DNA in the initial study. A later study refined the systems power for DNA classification [4].…”

Section: A Past Work With the Dwp Representationmentioning

confidence: 99%

Automatic Generation of Level Maps with the Do What’s Possible Representation

Ashlock

Salge

2019

2019 IEEE Conference on Games (CoG)

Self Cite

View full text Add to dashboard Cite

Automatic generation of level maps is a popular form of automatic content generation. In this study, a recently developed technique employing the do what's possible representation is used to create open-ended level maps. Generation of the map can continue indefinitely, yielding a highly scalable representation. A parameter study is performed to find good parameters for the evolutionary algorithm used to locate high quality map generators. Variations on the technique are presented, demonstrating its versatility, and an algorithmic variant is given that both improves performance and changes the character of maps located. The ability of the map to adapt to different regions where the map is permitted to occupy space are also tested.

show abstract

Section: A Past Work With the Dwp Representationmentioning

confidence: 99%

Automatic Generation of Level Maps with the Do What’s Possible Representation

Ashlock

Salge

2019

2019 IEEE Conference on Games (CoG)

Self Cite

View full text Add to dashboard Cite

show abstract

Section: B the Do What's Possible Representationmentioning

confidence: 99%

The Riddle of Togelby

Ashlock

Salge

2019

2019 IEEE Conference on Games (CoG)

Self Cite

View full text Add to dashboard Cite

At the 2017 Artificial and Computational Intelligence in Games meeting at Dagstuhl, Julian Togelius asked how to make spaces where every way of filling in the details yielded a good game. This study examines the possibility of enriching search spaces so that they contain very high rates of interesting objects, specifically game elements. While we do not answer the full challenge of finding good games throughout the space, this study highlights a number of potential avenues. These include naturally rich spaces, a simple technique for modifying a representation to search only rich parts of a larger search space, and representations that are highly expressive and so exhibit highly restricted and consequently enriched search spaces.

show abstract