Combinatorial search on graphs motivated by bioinformatics applications: A brief survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3787 LNCS, Issue , 2005, Pages 16-27

  Bouvel, Mathilde ^a   Grebinski, Vladimir ^b   Kucherov, Gregory ^c  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CompuGene Inc ^*  (United States)

^c LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GENES; IMAGE RECONSTRUCTION; QUERY LANGUAGES; SURVEYING;

BIOINFORMATICS; COMBINATORIAL SEARCH; GENOME SEQUENCING;

GRAPH THEORY;

EID: 33744937339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_2     Document Type: Conference Paper

References (22)

1. M. Aigner. Combinatorial Search. John Wiley and Sons, 1988.
2. B. Alberts, A. Johnson, J. Lewis, M. Raff, K. Roberts, and P. Walter. Molecular Biology of the Cell. Garland Science, 1994.
3. N. Alon. Separating matrices. Private communication, May 1997.
4. N. Alon and V. Asodi. Learning a hidden subgraph. In Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, volume 3142 of Lecture Notes in Computer Science, pages 110-121. Springer, 2004.
5. N. Alon, R. Beigel, S. Kasif, S. Rudich, and B. Sudakov. Learning a hidden matching. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2002, Vancouver, BC, Canada, 16-19 November 2002, pages 197-206. IEEE Computer Society Press, 2002.
6. D.G. Cantor and W.H. Mills. Determination of a subset from certain combinatorial properties. Can. J. Math, 18:42-48, 1966.
7. F. Cicalese, P. Damaschke, and U. Vaccaro. Optimal group testing algorithms with interval queries and their application to splice site detection. In Proc. of the Int. Workshop on Bioinformatics Research and Applications (IWBRA 2005), volume 3515 of Lectures Notes in Computer Science, pages 1029-1037. Springer, 2005.
8. D. Du and F. Hwang. Combinatorial group testing and its applications, volume 3. Series on applied Mathematics, 1993.
9. P. Erdös and A. Rényi. Asymmetric graphs. Acta Math. Acad. Sci. Hung. Acad. Sci., 14:295-315, 1963.
10. V. Grebinski. On the power of additive combinatorial search model. In Proc. of Computing and Combinatorics, 4th Annual International Conference, CO-COON'98, Taipei, Taiwan, August 12-14, 1998, volume 1449 of Lecture Notes in Computer Science, pages 194-203. Springer, 1998.
11. V. Grebinski and G. Kucherov. Reconstructing a hamiltonian cycle by querying the graph: Application to DNA physical mapping. Discrete Applied Mathematics, 88:147-165, 1998.
12. V. Grebinski and G. Kucherov. Reconstructing set partitions. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999), pages 915-916. ACM, SIAM, 1999.
13. V. Grebinski and G. Kucherov. Optimal reconstruction of graphs under the additive model. Algorithmica, 28:104-124, 2000.
14. G.W Klau, S. Rahmann, A. Schliep, M. Vingron, and K. Reinert. Optimal robust non-unique probe selection using integer linear programming. Bioinformatics, 20 (suppl. 1):i186-i193, 2004.
15. E. Knill and S. Muthukrishnan. Group testing problems in experimental molecular biology. Technical Report LAUR-95-1503, Los Alamos National Laboratory, March 1995.
16. M. Li and P. M. B. Vitányi. Kolmogorov complexity arguments in combinatorics. J. Comb. Theory Series A, 66(2):226-236, 1994.
17. B. Lindström. On a combinatorial problem in number theory. Canad. Math. Bull, 8:477-490, 1965.
18. B. Lindström. Determination of two vectors from the sum. J. Comb. Theory, 6:402-407, 1969.
19. B. Lindström. On Möbius functions and a problem in combinatorial number theory, Canad. Math. Bull., 14(4);513-516, 1971.
20. B. Lindström, On 62 sequences of vectors. Journal of Number Theory, 4:261-265, 1972.
21. B. Lindström. Determining subsets by unramified experiments. In editor J.N. Srivastava, editor, A Survey of Statistical Designs and Linear Models, pages 407-418. North Holland, Amsterdam, 1975.
22. R. M. Wilson. Decomposition of complete graphs into subgraphs isomorphic to a given graph. In Congressus Numerantium XV, pages 647-659, 1975.