SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 197-206

Learning a hidden matching

(5) Alon, Noga a,b Beigel, Richard a,c Kasif, Simon d Rudich, Steven e Sudakov, Benny a,f

a INSTITUTE FOR ADVANCED STUDY (United States)

b TEL AVIV UNIVERSITY (Israel)

c Temple University (United States)

d BOSTON UNIVERSITY (United States)

e CARNEGIE MELLON UNIVERSITY (United States)

f PRINCETON UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

COMPUTATIONAL BIOLOGY; HIDDEN MATCHING; RANDOMIZED NON ADAPTIVE ALGORITHM;

COMPUTATIONAL METHODS;

EID: 0036953747 PISSN: 02725428 EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (15)

References (8)

1
- 4243487173
- Learning a hidden matching
- N. Alon, R. Beigel, S. Kasif, S. Rudich and B. Sudakov, Learning a Hidden Matching, http://www.math.tau.ac.il/~nogaa/PDFS/abkrs.pdf, 2002.
- (2002)
- Alon, N.¹ Beigel, R.² Kasif, S.³ Rudich, S.⁴ Sudakov, B.⁵

2
- 0003430191
- Wiley, New York
- N. Alon and J. H. Spencer, The Probabilistic Method, Second Edition, Wiley, New York, 2000.
- (2000) The Probabilistic Method, Second Edition
- Alon, N.¹ Spencer, J.H.²

3
- 0034833407
- An optimal procedure for gap closing in whole genome shotgun sequencing
- ACM Press
- R. Beigel, N. Alon, M. S. Apaydin, L. Fortnow and S. Kasif, An optimal procedure for gap closing in whole genome shotgun sequencing, Proc. 2001 Recomb, ACM Press, pp. 22-30.
- Proc. 2001 Recomb , pp. 22-30
- Beigel, R.¹ Alon, N.² Apaydin, M.S.³ Fortnow, L.⁴ Kasif, S.⁵

4
- 0024725074
- Detection of deletions by the amplification of exons (multiplex PCR) in duchenne muscular dystrophy
- (in French)
- M. Claustres, P. Kjellberg, M. Desgeorges, H. Bellet, P. Sarda, H. Bonnet, C. Boileau, Detection of deletions by the amplification of exons (multiplex PCR) in Duchenne muscular dystrophy, J. Genet. Hum. 1989 37 (3): 251-257 (in French).
- (1989) J. Genet. Hum. , vol.37 , Issue.3 , pp. 251-257
- Claustres, M.¹ Kjellberg, P.² Desgeorges, M.³ Bellet, H.⁴ Sarda, P.⁵ Bonnet, H.⁶ Boileau, C.⁷

5
- 0030679028
- Optimal query bounds for reconstructing a hamiltonian cycle in complete graphs
- V. Grebinski and G. Kucherov, Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs, Proc. 5th Israeli Symposium on Theoretical Computer Science (1997),pp. 166-173.
- (1997) Proc. 5th Israeli Symposium on Theoretical Computer Science , pp. 166-173
- Grebinski, V.¹ Kucherov, G.²

6
- 0012576326
- Reconstructing a hamiltonian cycle by querying the graph: Application to DNA physical mapping
- V. Grebinski and G. Kucherov, Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping, Discrete Applied Math. 88 (1998), 147-165.
- (1998) Discrete Applied Math. , vol.88 , pp. 147-165
- Grebinski, V.¹ Kucherov, G.²

7
- 0033572258
- Pipette optimal multiplexed PCR: Efficiently closing whole genome shotgun sequencing project
- H. Tettelin, D. Radune, S. Kasif, H. Khouri, and S. Salzberg. Pipette Optimal Multiplexed PCR: Efficiently Closing Whole Genome Shotgun Sequencing Project, Genomics, Vol. 62, pp. 500-507, 1999.
- (1999) Genomics , vol.62 , pp. 500-507
- Tettelin, H.¹ Radune, D.² Kasif, S.³ Khouri, H.⁴ Salzberg, S.⁵

8
- 0001470993
- Decomposition of complete graphs into subgraphs isomorphic to a given graph
- R. M. Wilson, Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congressus Numerantium XV (1975), 647-659.
- (1975) Congressus Numerantium , vol.15 , pp. 647-659
- Wilson, R.M.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.