Sciweavers

400 search results - page 6 / 80
» On some Properties of DNA Graphs
Sort
View
GCC
2003
Springer
14 years 1 months ago
Some Grid Automata for Grid Computing
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
Hao Shen, Yongqiang Sun
DCC
2007
IEEE
14 years 7 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin
STOC
2006
ACM
168views Algorithms» more  STOC 2006»
14 years 8 months ago
A combinatorial characterization of the testable graph properties: it's all about regularity
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...
WABI
2004
Springer
132views Bioinformatics» more  WABI 2004»
14 years 1 months ago
Joint Analysis of DNA Copy Numbers and Gene Expression Levels
Abstract. Genomic instabilities, amplifications, deletions and translocations are often observed in tumor cells. In the process of cancer pathogenesis cells acquire multiple genom...
Doron Lipson, Amir Ben-Dor, Elinor Dehan, Zohar Ya...
FOCS
2005
IEEE
14 years 1 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira